Threshold computation and cryptographic security
- 1 January 1993
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 230-239
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Hiding instances in multioracle queries1990
- On hiding information from an oracleJournal of Computer and System Sciences, 1989
- Restricted relativizations of complexity classes1989
- Complexity classes without machines: On complete languages for UPTheoretical Computer Science, 1988
- Does co-NP have short interactive proofs?Information Processing Letters, 1987
- The polynomial-time hierarchy and sparse oraclesJournal of the ACM, 1986
- Trading group theory for randomness1985
- Some connections between nonuniform and uniform complexity classes1980
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975