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
An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against NatureIEEE via YouTube Computation in the Brain Tutorial - Part 2
IEEE via YouTube Computation in the Brain - Part 1
IEEE via YouTube Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model
IEEE via YouTube Cookbook Lower Bounds for Statistical Inference in Distributed and Constrained Settings - Part 1
IEEE via YouTube