On Reducibility Among Combinatorial Problems
| dc.contributor.author | Herrmann, Paul Peter | en_US |
| dc.date.accessioned | 2023-03-29T14:57:25Z | |
| dc.date.available | 2023-03-29T14:57:25Z | |
| dc.date.issued | 1973-12 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149420 | |
| dc.description.abstract | A large class of combinatorial problems have been shown by Cook and Karp to be computationally equivalent to within a polynomial. We exhibit some new problems in this class, and provide simpler proofs for some of the known reductions. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TR-113 | |
| dc.relation.ispartofseries | MAC-TR-113 | |
| dc.title | On Reducibility Among Combinatorial Problems | en_US |
| dc.identifier.oclc | 08229072 |
