dc.contributor.author | Boix-Adserà, Enric | |
dc.contributor.author | Brennan, Matthew | |
dc.contributor.author | Bresler, Guy | |
dc.date.accessioned | 2022-06-06T19:16:25Z | |
dc.date.available | 2022-06-06T19:16:25Z | |
dc.date.issued | 2021 | |
dc.identifier.uri | https://hdl.handle.net/1721.1/142892 | |
dc.language.iso | en | |
dc.publisher | Society for Industrial & Applied Mathematics (SIAM) | en_US |
dc.relation.isversionof | 10.1137/20M1316044 | en_US |
dc.rights | 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. | en_US |
dc.source | SIAM | en_US |
dc.title | The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs | en_US |
dc.type | Article | en_US |
dc.identifier.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. | |
dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | |
dc.relation.journal | SIAM Journal on Computing | en_US |
dc.eprint.version | Final published version | en_US |
dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
dc.date.updated | 2022-06-06T19:10:32Z | |
dspace.orderedauthors | Boix-Adserà, E; Brennan, M; Bresler, G | en_US |
dspace.date.submission | 2022-06-06T19:10:33Z | |
mit.license | PUBLISHER_POLICY | |
mit.metadata.status | Authority Work and Publication Information Needed | en_US |