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:
“... there was one of two things I had a right to, liberty, or death; if I could not have one, I would take de oder; for no man should take me alive; I should fight for my liberty as long as my strength lasted, and when de time came for me to go, de Lord would let dem take me.”
—Harriet Tubman (c. 1820–1913)