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:
“Farewell deare flowers, sweetly your time ye spent,
Fit, while ye liv’d, for smell or ornament,
And after death for cures.
I follow straight without complaints or grief,
Since if my sent be good, I care not, if
It be as short as yours.”
—George Herbert (1593–1633)