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:
“As nature requires whirlwinds and cyclones to release its excessive force in a violent revolt against its own existence, so the spirit requires a demonic human being from time to time whose excessive strength rebels against the community of thought and the monotony of morality ... only by looking at those beyond its limits does humanity come to know its own utmost limits.”
—Stefan Zweig (18811942)