Cook Versus Karp-Levin: Separating Completeness Notions if NP Is not Small (Extended Abstract) - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Jack H. Lutz, Elvira Mayordomo. Cook Versus Karp-Levin: Separating Completeness Notions if NP Is not Small (Extended Abstract). In Patrice Enjalbert, Ernst W. Mayr, Klaus W. Wagner, editors, STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings. Volume 775 of Lecture Notes in Computer Science, pages 415-426, Springer, 1994.

The following publications are possibly variants of this publication:

Cook Versus Karp-Levin: Separating Completeness Notions if NP is not SmallJack H. Lutz, Elvira Mayordomo. TCS, 164(1&2):141-163, 1996. [doi]

runs on WebDSL