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:
“Without music to decorate it, time is just a bunch of boring production deadlines or dates by which bills must be paid.”
—Frank Zappa (1940–1993)
Related Phrases
Related Words