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’s not that I don’t want to be a beauty, that I don’t yearn to be dripping with glamor. It’s just that I can’t see how any woman can find time to do to herself all the things that must apparently be done to make herself beautiful and, having once done them, how anyone without the strength of mind of a foreign missionary can keep up such a regime.”
—Cornelia Otis Skinner (1901–1979)