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 am admonished in many ways that time is pushing me inexorably along. I am approaching the threshold of age; in 1977 I shall be 142. This is no time to be flitting about the earth. I must cease from the activities proper to youth and begin to take on the dignities and gravities and inertia proper to that season of honorable senility which is on its way.”
—Mark Twain [Samuel Langhorne Clemens] (1835–1910)