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:
“It is now time to stop and to ask ourselves the question which my last commanding officer, Admiral Hyman Rickover, asked me and every other young naval officer who serves or has served in an atomic submarine. For our Nation M for all of us M that question is, “Why not the best?””
—Jimmy Carter (James Earl Carter, Jr.)