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 fear that if parents start listening to their own wants and needs they will neglect their children. It is our belief that children are in fact far less likely to be neglected when their parents’ needs—for support, for friendship, for decent work, for health care, for learning, for play, for time alone—are being met.”
—Wendy Coppedge Sanford. Ourselves and Our Children, by Boston Women’s Health Book Collective, introduction (1978)
Related Phrases
Related Words