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:
“The manuscript lay like a dust-rag on his desk, and Eitel found, as he had found before, that the difficulty of art was that it forced a man back on his life, and each time the task was more difficult and distasteful.”
—Norman Mailer (b. 1923)