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:
“For me, it’s enough! They’ve been here long enough—maybe too long. It’s a funny thing, though. All these years Fred was too busy to have much time for the kids, now he’s the one who’s depressed because they’re leaving. He’s really having trouble letting go. He wants to gather them around and keep them right here in this house.”
—Anonymous Parent. As quoted in Women of a Certain Age, by Lillian B. Rubin, ch. 2 (1979)