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:
“the gap of today filling itself
as emptiness is distributed
in the idea of what time it is
when that time is already past”
—John Ashbery (b. 1927)