scientific article; zbMATH DE number 5485572
From MaRDI portal
Publication:5302083
zbMath1231.68144MaRDI QIDQ5302083
Emanuele Viola, Ronen Shaltiel
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
On derandomizing Yao's weak-to-strong OWF construction ⋮ Complexity of hard-core set proofs ⋮ On the Security Loss in Cryptographic Reductions