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:
“Some of us who sit upon this platform have many a time been clamored down, and told that we had no right to speak, and that we were out of our place in public meetings; far be it from us, when women assemble, and a man has a thought in his soul, burning for utterance, to retaliate upon him.”
—Susan B. Anthony (1820–1906)