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:
“Before the time I did Lysander see,
Seemed Athens as a paradise to me.
O then, what graces in my love do dwell,
That he hath turned a heaven unto a hell?”
—William Shakespeare (1564–1616)