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:
“My time has been passed viciously and agreeably; at thirty-one so few years months days hours or minutes remain that “Carpe Diem” is not enough. I have been obliged to crop even the seconds—for who can trust to tomorrow?”
—George Gordon Noel Byron (1788–1824)
Related Phrases
Related Words