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 poor world is almost six thousand years old, and in all this time there was not any man died in his own person,
videlicet, in a love-cause.”
—William Shakespeare (1564–1616)
Related Phrases
Related Words