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:
“An individual is an encloser. Time and space, liberty and necessity, truth and thought, are left at large no longer.”
—Ralph Waldo Emerson (1803–1882)