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
Automata TheoryStanford University via edX Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX 算法设计与分析 Design and Analysis of Algorithms
Peking University via Coursera How to Win Coding Competitions: Secrets of Champions
ITMO University via edX Introdução à Ciência da Computação com Python Parte 2
Universidade de São Paulo via Coursera