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:
“It is too great comfort which turns a man against himself. Life is most readily renounced at the time and among the classes where it is least harsh.”
—Emile Durkheim (1858–1917)