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 brilliant kids, frisk with your dog,
Fondle your shells and sticks, bleached
By time and the elements; but there is a line
You must not cross”
—Hart Crane (1899–1932)
Related Phrases
Related Words