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:
“Mealtime’s the only time I get to devote to the things of the spirit.”
—John Dos Passos (1896–1970)
Related Phrases
Related Words