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:
“At about that time I was once sitting at my place and whispering—it was naughty, I know—with my neighbor. Then you, Herr Professor Rudner, got up from your desk, came calmly down the aisle to me: “Did you speak?” and slapped me smack in the face. And I—the fury is inside me to this day—I didn’t hit back. Such were the methods of objectivity.”
—Alfred Döblin (1878–1957)