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:
“Anybody who knows the difference between the kind of conversation you have walking in the woods and the kind of conversation you have between the segments of a show on Nickelodeon can tell you that quality time exists. Quality time is when you and your child are together and keenly aware of each other. You are enjoying the same thing at the same time, even if it is just being in a room or going for a drive in the car. You are somehow in tune, even while daring to be silent together.”
—Louise Lague (20th century)