On being incoherent without being very hard
- 1 March 1992
- journal article
- Published by Springer Nature in computational complexity
- Vol. 2 (1) , 1-17
- https://doi.org/10.1007/bf01276436
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Non-deterministic exponential time has two-prover interactive protocolscomputational complexity, 1991
- Self-testing/correcting with applications to numerical problemsPublished by Association for Computing Machinery (ACM) ,1990
- On hiding information from an oracleJournal of Computer and System Sciences, 1989
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- Designing programs that check their workPublished by Association for Computing Machinery (ACM) ,1989
- On helping by robust oracle machinesTheoretical Computer Science, 1987
- Robust algorithms: A different approach to oraclesTheoretical Computer Science, 1985
- Two theorems on random polynomial timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- Relativization of the theory of computational complexityTransactions of the American Mathematical Society, 1976
- Tally languages and complexity classesInformation and Control, 1974