Two Comments on Targeted Canonical Derandomizers

DOI10.1007/978-3-030-43662-9_4OpenAlexW159330758MaRDI QIDQ5098768

Oded Goldreich

Publication date: 30 August 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.422.3697

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20)

Related Items (1)

Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games

Cites Work

• Hardness vs randomness
• Randomness vs time: Derandomization under a uniform assumption
• In a World of P=BPP
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• The complexity of promise problems with applications to public-key cryptography
• An Unconditional Study of Computational Zero Knowledge
• Computational Complexity

This page was built for publication: Two Comments on Targeted Canonical Derandomizers