Cook is faster than Karp: a study of reducibilities in NP

Luc Longpré, Paul Young. Cook is faster than Karp: a study of reducibilities in NP. In Proceedings: Third Annual Structure in Complexity Theory Conference, Georgetown University, Washington, D. C., USA, June 14-17, 1988. pages 293-302, IEEE Computer Society, 1988. [doi]

Abstract

Abstract is missing.