YoVDO

The Average-Case Complexity of Counting Cliques in Erdos-Renyi Hypergraphs

Offered By: IEEE via YouTube

Tags

IEEE FOCS: Foundations of Computer Science Courses Algorithm Analysis Courses Theoretical Computer Science Courses Complexity Theory Courses Hypergraphs Courses

Course Description

Overview

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.

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

Algorithms, Part II
Princeton University via Coursera Intro to Algorithms
Udacity Analysis of Algorithms
Princeton University via Coursera 算法设计与分析 Design and Analysis of Algorithms
Peking University via Coursera Design and Analysis of Algorithms
Chennai Mathematical Institute via Swayam