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:
“Our fathers water’d with their tears
This sea of time whereon we sail,
Their voices were in all men’s ears
Who pass’d within their puissant hail.
Still the same ocean round us raves,
But we stand mute, and watch the waves.”
—Matthew Arnold (1822–1888)