Derandomization: Pseudo-randomness from Hardness - Part 1
Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only! Grab it 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.