PubPeer
The online Journal club
login
create account
Home
Publications
The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) (2019) -
Comments
doi: 10.1109/focs.2019.00078
Enric Boix-Adsera, Matthew Brennan, Guy Bresler
Go to article
Go to preprint
Comments awaiting moderation ({{totalComments}})
Review last reports ({{totalReports}})
Review last email suggestions ({{totalPendingEmails}})
Last month's whitelisted comments ({{totalWhitelistedComments}})