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:
““Come, come” said Tom’s father, “at your time of life,
There’s no longer excuse for thus playing the rake—
It is time you should think, boy, of taking a wife.”
“Why, so it is, father—whose wife shall I take?””
—Thomas Moore (1779–1852)