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:
“And you’re too fired up to go to sleep, you sit at the kitchen table. It’s really late, it’s really quiet, you’re tired. Don’t wanna go to bed, though. Going to bed means this was the day. This Feb. 12, this Aug. 3, this Nov. 20 is over and you’re tired and you made some money but it didn’t happen, nothing happened. You got through it and a whole day of your life is over. And all it is—is time to go to bed.”
—Claudia Shear, U.S. author. New York Times, p. A21 (September 29, 1993)