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:
“Had I but any time to lose,
On this I would it all dispose.
Cease Tempter. None can chain a mind
Whom this sweet Chordage cannot bind.”
—Andrew Marvell (1621–1678)
Related Phrases
Related Words