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:
“Custom calls me to’t.
What custom wills, in all things should we do’t,
The dust on antique time would lie unswept,
And mountainous error be too highly heaped
For truth to o’erpeer.”
—William Shakespeare (1564–1616)
Related Phrases
Related Words