Robust algorithms: A different approach to oracles
- 1 January 1985
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 40, 57-66
- https://doi.org/10.1016/0304-3975(85)90158-6
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- On Restricting the Size of Oracles Compared with Restricting Access to OraclesSIAM Journal on Computing, 1985
- Quantitative Relativizations of Complexity ClassesSIAM Journal on Computing, 1984
- BPP and the polynomial hierarchyInformation Processing Letters, 1983
- A note on sparse oracles for NPJournal of Computer and System Sciences, 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
- The Power of Dominance Relations in Branch-and-Bound AlgorithmsJournal of the ACM, 1977
- Relative complexity of checking and evaluatingInformation Processing Letters, 1976
- “Helping”: several formalizationsThe Journal of Symbolic Logic, 1975