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:
“There comes a time when suddenly you realize that laughter is something you remember and that you were the one laughing.”
—Marlene Dietrich (1904–1992)