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:
“Man is always more than he can know of himself; consequently, his accomplishments, time and again, will come as a surprise to him.”
—Golo Mann (b. 1909)