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:
“There is no doubt: the study of man is just beginning, at the same time that his end is in sight.”
—Elias Canetti (b. 1905)