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:
“But you think ... that it is time for me to have done with the world, and so I would if I could get into a better before I was called into the best, and not die here in a rage, like a poisoned rat in a hole.”
—Jonathan Swift (1667–1745)