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:
“We are double-edged blades, and every time we whet our virtue the return stroke straps our vice. Where is the skillful swordsman who can give clean wounds, and not rip up his work with the other edge?”
—Henry David Thoreau (1817–1862)