An algorithm for which it can be shown that the number of steps required to find a solution to a problem is bounded by a polynomial function of the problem's data. Computational complexity; Exponential-bounded algorithm.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Kluwer Academic Publishers
About this entry
Cite this entry
Gass, S.I., Harris, C.M. (2001). POLYNOMIALLY BOUNDED (-TIME) ALGORITHM ( Polynomial algorithm). In: Gass, S.I., Harris, C.M. (eds) Encyclopedia of Operations Research and Management Science. Springer, New York, NY. https://doi.org/10.1007/1-4020-0611-X_770
Download citation
DOI: https://doi.org/10.1007/1-4020-0611-X_770
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-7923-7827-3
Online ISBN: 978-1-4020-0611-1
eBook Packages: Springer Book Archive