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:
“At the time there was a claustral monk named Frere Jean of the Hashes, who was young, gallant, joyful, good natured, dextrous, bold, adventurous, thoughtful, tall, thin, with a capacious mouth, gifted in the nose, a great dispatcher of hours, quite an accomplisher of masses, a quick doer-in of vigils,—to put it in a nutshell, a true monk if ever there’s been one since this monk of a world first monked out a monk; moreover, a cleric to his very teeth in matters of the breviary.”
—François Rabelais (1494–1553)