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:
“Middle age is the time when a man is always thinking that in a week or two he will feel as good as ever.”
—Don Marquis (1878–1937)