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:
“In a time of war the nation is always of one mind, eager to hear something good of themselves and ill of the enemy. At this time the task of news-writers is easy, they have nothing to do but to tell that a battle is expected, and afterwards that a battle has been fought, in which we and our friends, whether conquering or conquered, did all, and our enemies did nothing.”
—Samuel Johnson (1709–1784)