On Reducibility Among Combinatorial Problems

Thumbnail Image
Download
Name

MIT-LCS-TR-113.pdf

Size

722.71 KB

Format

Adobe PDF

Checksum (MD5)

34b253fa38a467ad79f816ab524e6e4a

Author(s)
Herrmann, Paul Peter
Date Issued
December 1973
Series/Report no.
MIT-LCS-TR-113
MAC-TR-113
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.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.