We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

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

Thumbnail Image
Download
Name

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

Description
Published version
Size

673.36 KB

Format

Adobe PDF

Checksum (MD5)

5774c71aec642f6639ea94ac37faeaf3

sword-2022-06-06T19:10:32.original.xml (130 B)
Original SWORD entry document
Author(s)
Boix-Adserà, Enric
•
Brennan, Matthew
•
Bresler, Guy
Date Issued
2021
Journal
SIAM Journal on Computing
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Citation
Boix-Adserà, Enric, Brennan, Matthew and Bresler, Guy. 2021. "The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs." SIAM Journal on Computing.
Version
Final published version
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1137/20M1316044
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.