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:
““Let the jury consider their verdict,” the King said, for about the twentieth time that day.
“No, no!” said the Queen. “Sentence first—verdict afterwards.”
“Stuff and nonsense!” said Alice loudly. “The idea of having the sentence first!””
—Lewis Carroll [Charles Lutwidge Dodgson] (1832–1898)