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 time at our disposal each day is elastic; the passions we feel dilate it, those that inspire us shrink it, and habit fills it.”
—Marcel Proust (1871–1922)