Encyclopedia of Operations Research and Management Science

2013 Edition
| Editors: Saul I. Gass, Michael C. Fu

Polynomially Bounded (−Time) Algorithm (Polynomial Algorithm)

Reference work entry
DOI: https://doi.org/10.1007/978-1-4419-1153-7_200611

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.

See

Copyright information

© Springer Science+Business Media New York 2013