On the random-self-reducibility of complete sets
- 10 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 124-132
- https://doi.org/10.1109/sct.1991.160252
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Gap-definable counting classesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Lower bounds on random-self-reducibilityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Self-testing/correcting with applications to numerical problemsPublished by Association for Computing Machinery (ACM) ,1990
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- With probability one, a random oracle separates PSPACE from the polynomial-time hierarchyJournal of Computer and System Sciences, 1989
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classesJournal of Computer and System Sciences, 1988
- Random oracles separate PSPACE from the polynomial-time hierarchyInformation Processing Letters, 1987
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- Some consequences of non-uniform conditions on uniform classesTheoretical Computer Science, 1983