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:
“Her heavenly form
Angelic, but more soft and feminine,
Her graceful innocence, her every air
Of gesture or least action, overawed
His malice, and with rapine sweet bereaved
His fierceness of the fierce intent it brought.
That space of Evil One abstracted stood
From his own evil, and for the time remained
Stupidly good, of enmity disarmed,”
—John Milton (1608–1674)