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:

    “It’s true, as Marya Mannes says: “No one believes [a woman’s] time to be sacred. A man at his desk in a room with a closed door is a man at work. A woman at a desk in any room is available.””
    —Lillian Breslow Rubin (20th century)