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:
“Pleasure is necessarily reciprocal; no one feels it who does not at the same time give it. To be pleased, one must please. What pleases you in others, will in general please them in you.”
—Philip Dormer Stanhope, 4th Earl Chesterfield (1694–1773)