Browsing LCS Technical Reports (1974 - 2003) by Author "Herrmann, Paul Peter"
Now showing items 1-1 of 1
-
On Reducibility Among Combinatorial Problems
Herrmann, Paul Peter (1973-12)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 ...