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.
New Techniques for Proving Fine-Grained Average-Case Hardness
Overview
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
-
A Fine Grained Approach to Complexity
-
Fine-Grained Complexity - Lecture 1
-
The Average-Case Complexity of Counting Cliques in Erdos-Renyi Hypergraphs
-
Fine-Grained Complexity 3 - Logic and Algorithms in Database Theory and AI
-
Fine-Grained Algorithms and Complexity - An Overview of Exact Running Times
-
Hardness Magnification for All Sparse NP Languages
