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:
“In a time of confusion and rapid change like the present, when terms are continually turning inside out and the names of things hardly keep their meaning from day to day, it’s not possible to write two honest paragraphs without stopping to take crossbearings on every one of the abstractions that were so well ranged in ornate marble niches in the minds of our fathers.”
—John Dos Passos (1896–1970)