Time Complexity - Polylogarithmic Time

An algorithm is said to run in polylogarithmic time if T(n) = O((log n)k), for some constant k. For example, matrix chain ordering can be solved in polylogarithmic time on a Parallel Random Access Machine.

Read more about this topic:  Time Complexity

Famous quotes containing the word time:

    “To Time it never seems that he is brave
    To set himself against the peaks of snow
    To lay them level with the running wave,
    Nor is he overjoyed when they lie low,
    But only grave, contemplative and grave.”
    —Robert Frost (1874–1963)