YoVDO

Derandomization and Meta-complexity - Part 2

Offered By: Centre International de Rencontres Mathématiques via YouTube

Tags

Derandomization Courses Algorithm Analysis Courses Randomized Algorithms Courses Theoretical Computer Science Courses Computational Complexity Theory Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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

Automata Theory
Stanford University via edX
Intro to Theoretical Computer Science
Udacity
Computing: Art, Magic, Science
ETH Zurich via edX
理论计算机科学基础 | Introduction to Theoretical Computer Science
Peking University via edX
Quantitative Formal Modeling and Worst-Case Performance Analysis
EIT Digital via Coursera