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 man who spends all his time looking up to heaven is not always the best; in fact, he is usually the worst.”
—José Bergamín (1895–1983)