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:
“It was a time of madness, the sort of mad-hysteria that always presages war. There seems to be nothing left but war—when any population in any sort of a nation gets violently angry, civilization falls down and religion forsakes its hold on the consciences of human kind in such times of public madness.”
—Rebecca Latimer Felton (1835–1930)