Derandomization: Pseudo-randomness from Hardness - Part 1
Offered By: Centre International de Rencontres Mathématiques via YouTube
Course Description
Overview
Explore a comprehensive tutorial on derandomization, focusing on pseudo-randomness from hardness in this first part of a series presented by Valentine Kabanets. Recorded during the thematic meeting "Randomness, Information & Complexity" at the Centre International de Rencontres Mathématiques in Marseille, France, this 1 hour and 15 minutes lecture delves into advanced mathematical concepts. Access this video and other talks by renowned mathematicians through CIRM's Audiovisual Mathematics Library, which offers features such as chapter markers, keywords, enriched content with abstracts and bibliographies, and a multi-criteria search function. Gain valuable insights into this complex mathematical topic and enhance your understanding of derandomization techniques.
Syllabus
Valentine Kabanets: Derandomization, tutorial - part 1: Pseudo-randomness from hardness
Taught by
Centre International de Rencontres Mathématiques
Related Courses
The Next Generation of InfrastructureDelft University of Technology via edX The Beauty and Joy of Computing - AP® CS Principles Part 2
University of California, Berkeley via edX Advanced Data Structures in Java
University of California, San Diego via Coursera Theory of Computation
Indian Institute of Technology Kanpur via Swayam 离散数学
Shanghai Jiao Tong University via Coursera