On helping by robust oracle machines
- 31 December 1987
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 52 (1-2) , 15-36
- https://doi.org/10.1016/0304-3975(87)90078-8
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On Circuit-Size Complexity and the Low Hierarchy in NPSIAM Journal on Computing, 1985
- Robust algorithms: A different approach to oraclesTheoretical Computer Science, 1985
- A low and a high hierarchy within NPJournal of Computer and System Sciences, 1983
- 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
- Analogues of semirecursive sets and effective reducibilities to the study of NP complexityInformation and Control, 1982
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- On Isomorphisms and Density of $NP$ and Other Complete SetsSIAM Journal on Computing, 1977
- Complete sets and the polynomial-time hierarchyTheoretical Computer Science, 1976
- Relative complexity of checking and evaluatingInformation Processing Letters, 1976