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:
“A great proportion of architectural ornaments are literally hollow, and a September gale would strip them off, like borrowed plumes, without injury to the substantials.... What if an equal ado were made about the ornaments of style in literature, and the architects of our bibles spent as much time about their cornices as the architects of our churches do? So are made the belles-lettres and the beaux-arts and their professors.”
—Henry David Thoreau (1817–1862)