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:
“I have been in the editorial business going on fourteen years, and it is the first time I ever heard of a man’s having to know anything in order to edit a newspaper.”
—Mark Twain [Samuel Langhorne Clemens] (1835–1910)