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:
“The value of life lies not in the length of days but in the use you make of them; he has lived for a long time who has little lived.”
—Michel de Montaigne (1533–1592)