Work

On Reducibility Among Combinatorial Problems

Year: 1973
Type: report
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.
Language: English
Open Access status: green
OpenAlex ID: W2289048564
Cites: 5
Cited by: 6
Related to: 10