New Techniques for Proving Fine-Grained Average-Case Hardness

New Techniques for Proving Fine-Grained Average-Case Hardness

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.