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:
““What can be shown?
What true love be?
All could be known or shown
If Time were but gone.””
—William Butler Yeats (1865–1939)