Random-Self-Reducibility of Complete Sets
- 1 October 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 22 (5) , 994-1005
- https://doi.org/10.1137/0222061
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Security with Low Communication OverheadPublished by Springer Nature ,2001
- Counting classes: thresholds, parity, mods, and fewnessTheoretical Computer Science, 1992
- Arithmetization: A new method in structural complexity theorycomputational complexity, 1991
- Non-deterministic exponential time has two-prover interactive protocolscomputational complexity, 1991
- Hiding instances in multioracle queriesPublished by Springer Nature ,1990
- On hiding information from an oracleJournal of Computer and System Sciences, 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