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:
“Literature exists at the same time in the modes of error and truth; it both betrays and obeys its own mode of being.”
—Paul Deman (1919–1983)