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:
“He who has been impoverished for a long time ... who has long stood before the door of the mighty in darkness and begged for alms, has filled his heart with bitterness so that it resembles a sponge full of gall; he knows about the injustice and folly of all human action and sometimes his lips tremble with rage and a stifled scream.”
—Stefan Zweig (18811942)