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:
“It is a time when one’s spirit is subdued and sad, one knows not why; when the past seems a storm-swept desolation, life a vanity and a burden, and the future but a way to death.”
—Mark Twain [Samuel Langhorne Clemens] (1835–1910)