AI, Data Science & Cloud Certificates from Google, IBM & Meta
Get 20% off all career paths from fullstack to AI
Overview
Google, IBM & Meta Certificates – 40% Off
One plan covers every Professional Certificate on Coursera.
Unlock All Certificates
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