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:
“The writer operates at a peculiar crossroads where time and place and eternity somehow meet. His problem is to find that location.”
—Flannery O’Connor (1925–1964)