The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs.

Enric Boix-Adserà Matthew S. Brennan Guy Bresler

Published in: FOCS (2019)

Keyphrases

average case complexity
average case
lower bound
graph theory
shannon entropy
maximal cliques
uniform distribution
weighted graph
machine learning
objective function
upper bound
machine learning algorithms
graph structure
graph search
statistical queries