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:
“If Los Angeles is not the one authentic rectum of civilization, then I am no anatomist. Any time you want to go out again and burn it down, count me in.”
—H.L. (Henry Lewis)