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:
“Every epoch which seeks renewal first projects its ideal into a human form. In order to comprehend its own essence tangibly, the spirit of the time chooses a human being as its prototype and raising this single individual, often one upon whom it has chanced to come, far beyond his measure, the spirit enthuses itself for its own enthusiasm.”
—Stefan Zweig (18811942)