Derandomization and Meta-complexity - Part 2
Offered By: Centre International de Rencontres Mathématiques via YouTube
Course Description
Overview
Explore the second part of a tutorial on derandomization focusing on meta-complexity, presented by Valentine Kabanets at the Centre International de Rencontres Mathématiques in Marseille, France. Delve into advanced mathematical concepts during this 1-hour and 8-minute conference talk, recorded as part of the thematic meeting "Randomness, Information & Complexity" on February 20, 2024. Access this video and other presentations by renowned mathematicians through CIRM's Audiovisual Mathematics Library, which offers features such as chapter markers, keywords, enriched content with abstracts and bibliographies, and multi-criteria search options. Gain insights into cutting-edge research in randomness, information theory, and complexity through this comprehensive lecture.
Syllabus
Valentine Kabanets: Derandomization, tutorial - part 2: Meta-complexity
Taught by
Centre International de Rencontres Mathématiques
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