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:
“Cats are the ultimate narcissists. You can tell this because of all the time they spend on personal grooming. Dogs aren’t like this. A dog’s idea of personal grooming is to roll in a dead fish. Dogs spend their time thinking about doing good deeds for their masters, or sleeping.”
—James Gorman (b. 1949)