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:
“No man can love a second time the person whom he has once truly ceased to love.”
—François, Duc De La Rochefoucauld (1613–1680)