Derandomization: A Quick Tutorial
Offered By: Simons Institute via YouTube
Course Description
Overview
Explore a comprehensive tutorial on derandomization, focusing on transforming doubly efficient constant-round interactive protocols into NP-type verifiers with similar time complexity. Delve into the construction of NP-type deterministic argument systems for counting satisfying assignments of large formulas under strong hardness assumptions. Examine the use of targeted pseudorandom generators (tarPRGs) in the interactive protocol setting, drawing parallels to the Fiat-Shamir approach. Learn about the application of complexity-theoretic assumptions that don't necessarily imply one-way functions. Gain insights into recent advancements in derandomization techniques and their implications for cryptography and computational complexity theory.
Syllabus
Derandomization: A Quick Tutorial
Taught by
Simons Institute
Related Courses
Randomized Methods in ComplexityIndian Institute of Technology Kanpur via Swayam Strong Average-Case Circuit Lower Bounds from Non-trivial Derandomization - Lijie Chen
Institute for Advanced Study via YouTube Expander Graph Application 2: Derandomization - Lecture 16c of CS Theory Toolkit
Ryan O'Donnell via YouTube Strong Average-Case Circuit Lower Bounds from Non-trivial Derandomization
Association for Computing Machinery (ACM) via YouTube High-Precision Estimation of Random Walks in Small Space
IEEE via YouTube