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:
“When I first heard Elvis’s voice I just knew that I wasn’t going to work for anybody and nobody was gonna be my boss. Hearing him for the first time was like busting out of jail.”
—Bob Dylan [Robert Allen Zimmerman] (b. 1941)