On gamma-Reducibility versus Polynomial Time Many-One Reducibility (Extended Abstract)

Timothy J. Long. On gamma-Reducibility versus Polynomial Time Many-One Reducibility (Extended Abstract). In Conference Record of the Eleventh Annual ACM Symposium on Theory of Computing, 30 April-2 May, 1979, Atlanta, Georgia, USA. pages 278-287, ACM, 1979.

Abstract

Abstract is missing.