Roei Tell: Derandomization - Part 2
Roei Tell from the University of Toronto continues his three-part tutorial on derandomization, presented at the Frontiers in Complexity Theory workshop aimed at graduate students.

DIMACS CCICADA
121 views โข Aug 13, 2024

About this video
Roei Tell, University of Toronto, presents a three-part tutorial on derandomization at the Frontiers in Complexity Theory workshop for graduate students held at DIMACS July 29 - August 1, 2024. This is Part 2.
Description: The focus of this tutorial is derandomization, and in particular new developments in hardness vs randomness. We will first introduce textbook results, such as the reconstructive paradigm (Nisan-Wigderson, Impagliazzo-Wigderson) and hardness amplification. Then we will study new tools in this area from recent years, focused on constructions of targeted pseudorandom generators from functions hard for uniform algorithms. We'll conclude with very recent applications -- in particular, we will see the construction of a pseudodeterministic polynomial-time algorithm that finds prime numbers!
Link to workshop webpage: http://dimacs.rutgers.edu/events/details?eID=2785
Description: The focus of this tutorial is derandomization, and in particular new developments in hardness vs randomness. We will first introduce textbook results, such as the reconstructive paradigm (Nisan-Wigderson, Impagliazzo-Wigderson) and hardness amplification. Then we will study new tools in this area from recent years, focused on constructions of targeted pseudorandom generators from functions hard for uniform algorithms. We'll conclude with very recent applications -- in particular, we will see the construction of a pseudodeterministic polynomial-time algorithm that finds prime numbers!
Link to workshop webpage: http://dimacs.rutgers.edu/events/details?eID=2785
Video Information
Views
121
Likes
1
Duration
01:50:17
Published
Aug 13, 2024
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.