On γ-reducibility versus polynomial time many-one reducibility
- 31 December 1981
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 14 (1) , 91-101
- https://doi.org/10.1016/0304-3975(81)90007-4
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Relative complexity of checking and evaluatingInformation Processing Letters, 1976
- A comparison of polynomial time reducibilitiesTheoretical Computer Science, 1975