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:
“O time that cut’st down all!
And scarce leav’st here
Memoriall
Of any men that were.”
—Robert Herrick (1591–1674)