Self-reducibility
- 2 December 1990
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 41 (3) , 367-388
- https://doi.org/10.1016/0022-0000(90)90025-g
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Nondeterministic Space is Closed under ComplementationSIAM Journal on Computing, 1988
- The polynomial-time hierarchy and sparse oraclesJournal of the ACM, 1986
- 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
- A Note on Sparse Complete SetsSIAM Journal on Computing, 1979
- The circuit value problem is log space complete for PACM SIGACT News, 1975
- The Hardest Context-Free LanguageSIAM Journal on Computing, 1973
- Characterizations of Pushdown Machines in Terms of Time-Bounded ComputersJournal of the ACM, 1971
- Time and tape complexity of pushdown automaton languagesInformation and Control, 1968