ON REDUCIBILITY AMONG COMBINATORIAL PROBLEMS

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. {PB 226-157/AS}