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:
“And what avails it that science has come to treat space and time as simply forms of thought, and the material world as hypothetical, and withal our pretension of property and even of self-hood are fading with the rest, if, at last, even our thoughts are not finalities, but the incessant flowing and ascension reach these also, and each thought which yesterday was a finality, to-day is yielding to a larger generalization?”
—Ralph Waldo Emerson (1803–1882)