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 surprises of thought are like those of love: they wear out. But here too you can carry on for a long time doing your conjugal duty.”
—Jean Baudrillard (b. 1929)