𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Derandomizing Arthur—Merlin games under uniform assumptions

✍ Scribed by C.-J. Lu

Publisher
Springer
Year
2001
Tongue
English
Weight
296 KB
Volume
10
Category
Article
ISSN
1016-3328

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Randomness vs Time: Derandomization unde
Randomness vs Time: Derandomization under a Uniform Assumption
✍ Russell Impagliazzo; Avi Wigderson 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 182 KB

We prove that if BPP ] EXP, then every problem in BPP can be solved deterministically in subexponential time on almost every input (on every sampleable ensemble for infinitely many input sizes). This is the first derandomization result for BPP based on uniform, noncryptographic hardness assumptions.