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:
“The time of the seasons and the constellations
The time of milking and the time of harvest
The time of the coupling of man and woman
And that of beasts. Feet rising and falling.
Eating and drinking. Dung and death.”
—T.S. (Thomas Stearns)