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:
“Publicity is the life of this culture—in so far as without publicity capitalism could not survive—and at the same time publicity is its dream.”
—John Berger (b. 1926)