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 will be seen that we contemplate a time when man’s will shall be law to the physical world, and he shall no longer be deterred by such abstractions as time and space, height and depth, weight and hardness, but shall indeed be the lord of creation.”
—Henry David Thoreau (1817–1862)