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:
“There comes a time in every rightly constructed boy’s life when he has a raging desire to go somewhere and dig for hidden treasure.”
—Mark Twain [Samuel Langhorne Clemens] (1835–1910)