New Techniques for Proving Fine-Grained Average-Case Hardness
Offered By: IEEE via YouTube
Course Description
Overview
Explore cutting-edge techniques for demonstrating fine-grained average-case hardness in this IEEE conference talk. Delve into topics such as Counting KClick, Self Reduction for KClick, and the Framework for Factored OB and Factored Problems. Join MIT researchers Mina Dalirrooyfard, Andrea Lincoln, and Virginia Vassilevska Williams as they present their findings and discuss the implications for computational complexity theory.
Syllabus
Introduction
Counting KClick
Self Reduction for KClick
Framework
Factored OB
Factored Problems
Results
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
Algorithms, Part IIPrinceton University via Coursera Intro to Algorithms
Udacity Analysis of Algorithms
Princeton University via Coursera 算法设计与分析 Design and Analysis of Algorithms
Peking University via Coursera Design and Analysis of Algorithms
Chennai Mathematical Institute via Swayam