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:
“As you are entered with the class of Nat. philosophy, give to it the hours of lecture, but devote all your other time to Mathematics, avoiding company as the bane of all progress.”
—Thomas Jefferson (1743–1826)