Robust oracle machines
- 23 November 2005
- book chapter
- Published by Springer Nature
- p. 93-106
- https://doi.org/10.1007/bfb0017134
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Self-reducibilityPublished by Springer Nature ,2006
- On helping by robust oracle machinesTheoretical Computer Science, 1987
- Does co-NP have short interactive proofs?Information Processing Letters, 1987
- On hiding information from an oraclePublished by Association for Computing Machinery (ACM) ,1987
- On Circuit-Size Complexity and the Low Hierarchy in NPSIAM Journal on Computing, 1985
- Trading group theory for randomnessPublished by Association for Computing Machinery (ACM) ,1985
- The knowledge complexity of interactive proof-systemsPublished by Association for Computing Machinery (ACM) ,1985
- On self-reducibility and weak P-selectivityJournal of Computer and System Sciences, 1983
- On sparse sets in NP–PInformation Processing Letters, 1983
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977