Threshold Computation and Cryptographic Security
From MaRDI portal
Publication:4337431
DOI10.1137/S0097539792240467zbMath0868.68056OpenAlexW2020029222WikidataQ30053119 ScholiaQ30053119MaRDI QIDQ4337431
Hemaspaandra, Lane A., Yenjo Han, Thomas Thierauf
Publication date: 17 August 1997
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539792240467
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Query-monotonic Turing reductions, Computational tameness of classical non-causal models, The landscape of communication complexity classes, Languages polylog-time reducible to dot-depth 1/2, Complexity results in graph reconstruction, Computational complexity of the landscape. I., Commuting quantum circuits and complexity of Ising partition functions, The consequences of eliminating NP solutions, Lower bounds and the hardness of counting properties, Quantum computing, postselection, and probabilistic polynomial-time, The robustness of LWPP and WPP, with an application to graph reconstruction, Error-bounded probabilistic computations between MA and AM, Rectangles Are Nonnegative Juntas, SELF-SPECIFYING MACHINES, Relativized worlds with an infinite hierarchy
