Explore the intricacies of counting cliques in Erdos-Renyi hypergraphs in this 18-minute IEEE conference talk. Delve into uniform hypergraphs, lower bounds, and motivation behind the research. Gain insights into related work and the main theorem presented. Learn about proof techniques, including random KQ accounting and its reduction. Understand the role of binary expansions in the analysis. Conclude by examining open problems in the field, providing a comprehensive overview of average-case complexity in hypergraph clique counting.
The Average-Case Complexity of Counting Cliques in Erdos-Renyi Hypergraphs
Overview
Syllabus
Intro
Uniform Hypergraphs
Lower Bounds
Motivation
Related Work
Main Theorem
Proof Techniques
Random KQ Accounting
Reducing KQ Accounting
Binary Expansions
Open Problems
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
-
Hardness Magnification for All Sparse NP Languages
-
Strong Average-Case Circuit Lower Bounds from Non-trivial Derandomization
-
Optimal Streaming Approximations for All Boolean Max 2-CSPs and Max k-SAT
-
Characterizing Average-Case Complexity of PH by Worst-Case Meta-Complexity
-
Derandomization from Algebraic Hardness - Treading the Borders
-
Lower Bounds for Maximal Matchings and Maximal Independent Sets
