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:
“Don’t feel guilty if you don’t immediately love your stepchildren as you do your own, or as much as you think you should. Everyone needs time to adjust to the new family, adults included. There is no such thing as an “instant parent.”
Actually, no concrete object lies outside of the poetic sphere as long as the poet knows how to use the object properly.”
—Johann Wolfgang Von Goethe (1749–1832)