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:
“When shall we see poets born? After a time of disasters and great misfortunes, when harrowed nations begin to breathe again. And then, shaken by the terror of such spectacles, imaginations will paint things entirely strange to those who have not witnessed them.”
—Denis Diderot (1713–1784)