YoVDO

Derandomization: Pseudo-randomness from Hardness - Part 1

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

Tags

Derandomization Courses Cryptography Courses Randomized Algorithms Courses Computational Complexity Courses Complexity Theory Courses

Course Description

Overview

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

Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Stanford University via Coursera
Unpredictable? Randomness, Chance and Free Will
National University of Singapore via Coursera
Biology Meets Programming: Bioinformatics for Beginners
University of California, San Diego via Coursera
Finding Hidden Messages in DNA (Bioinformatics I)
University of California, San Diego via Coursera
Algorithms for Big Data
Indian Institute of Technology Madras via Swayam