Smoothing the Gap Between NP and ER
Offered By: IEEE via YouTube
Course Description
Overview
Explore a 23-minute IEEE conference talk that delves into smoothing techniques to bridge the gap between NP and ER problems. Join Jeff Erickson, Ivor van der Hoog, and Tillmann Miltzow as they present their research on applying smooth analysis to computational geometry problems. Learn about the standard model, the rationale behind smooth analysis, and its effectiveness in tackling complex computational challenges. Discover key results and their implications for ER-complete problems and recognition problems, with a practical example to illustrate the concepts discussed.
Syllabus
Intro
Detour
Standard model
Smooth Analysis
Why does it work
First result
Second result
ER complete problems
Recognition problems
Example
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
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