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 had been a time on earth when poets had been young and dead and famous—and were men. But now the poet as the tragic child of grandeur and destiny had changed. The child of genius was a woman, now, and the man was gone.”
—Thomas Wolfe (1900–1938)