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:

    MacDonagh and MacBride
    And Connolly and Pearse
    Now and in time to be,
    Wherever green is worn,
    Are changed, changed utterly:
    A terrible beauty is born.
    William Butler Yeats (1865–1939)