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:
“When a man spends his time giving his wife criticism and advice instead of compliments, he forgets that it was not his good judgment, but his charming manners, that won her heart.”
—Helen Rowland (1875–1950)