Encyclopedia of Operations Research and Management Science

2001 Edition
| Editors: Saul I. Gass, Carl M. Harris

Strongly polynomial-time algorithm

Reference work entry
DOI: https://doi.org/10.1007/1-4020-0611-X_1013
  • 30 Downloads

One whose running time is independent of the sizes of the numerical data of the instance. Computational complexity.

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  1. 1.Robert H. Smith School of BusinessUniversity of MarylandCollege PartUSA
  2. 2.School of Information Technology & EngineeringGeorge Mason UniversityFairfaxUSA