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 is not opium which makes me work but its absence, and in order for me to feel its absence it must from time to time be present.”
—Antonin Artaud (1896–1948)