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:
“Old hippies don’t die, they just lie low until the laughter stops and their time comes round again.”
—Joseph Gallivan (b. 1964)