On the Complexity of Integer Programming
| dc.contributor.author | Papadimitriou, Christos H. | en_US |
| dc.date.accessioned | 2023-03-29T14:15:43Z | |
| dc.date.available | 2023-03-29T14:15:43Z | |
| dc.date.issued | 1980-02 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/148979 | |
| dc.description.abstract | We give a simple proof that integer programming is in NP. Our proof also establishes that there is a pseudopolynomial time algorithm for integer programming with any (fixed) number of constraints. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TM-152 | |
| dc.title | On the Complexity of Integer Programming | en_US |
| dc.identifier.oclc | 6681422 |
