Self-reducibility
- 31 January 2006
- book chapter
- Published by Springer Nature
- p. 136-147
- https://doi.org/10.1007/bfb0039601
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The polynomial-time hierarchy and sparse oraclesJournal of the ACM, 1986
- Complexity and StructureLecture Notes in Computer Science, 1986
- NP-CompletenessPublished by Springer Nature ,1984
- On self-reducibility and weak P-selectivityJournal of Computer and System Sciences, 1983
- Sparse complete sets for NP: Solution of a conjecture of Berman and HartmanisJournal of Computer and System Sciences, 1982
- AlternationJournal of the ACM, 1981
- Some connections between nonuniform and uniform complexity classesPublished by Association for Computing Machinery (ACM) ,1980
- A Note on Sparse Complete SetsSIAM Journal on Computing, 1979
- Relative complexity of checking and evaluatingInformation Processing Letters, 1976