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:
“Everyone is desirous of his own pursuits, and loves
To spend his time in his accustomed art.”
—Ovid (Publius Ovidius Naso)