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 advantage of having a bad memory is that you can enjoy the same good things for the first time several times.”
—Friedrich Nietzsche (1844–1900)