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 from time to time congratulating myself on my general want of success as a lecturer; apparent want of success, but is it not a real triumph? I do my work clean as I go along, and they will not be likely to want me anywhere again. So there is no danger of my repeating myself, and getting to a barrel of sermons, which you must upset, and begin again with.”
—Henry David Thoreau (1817–1862)