Show simple item record

dc.contributor.authorBoix-Adserà, Enric
dc.contributor.authorBrennan, Matthew
dc.contributor.authorBresler, Guy
dc.date.accessioned2022-06-06T19:16:25Z
dc.date.available2022-06-06T19:16:25Z
dc.date.issued2021
dc.identifier.urihttps://hdl.handle.net/1721.1/142892
dc.language.isoen
dc.publisherSociety for Industrial & Applied Mathematics (SIAM)en_US
dc.relation.isversionof10.1137/20M1316044en_US
dc.rightsArticle 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.sourceSIAMen_US
dc.titleThe Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphsen_US
dc.typeArticleen_US
dc.identifier.citationBoix-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.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
dc.relation.journalSIAM Journal on Computingen_US
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dc.date.updated2022-06-06T19:10:32Z
dspace.orderedauthorsBoix-Adserà, E; Brennan, M; Bresler, Gen_US
dspace.date.submission2022-06-06T19:10:33Z
mit.licensePUBLISHER_POLICY
mit.metadata.statusAuthority Work and Publication Information Neededen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record