Show simple item record

dc.contributor.authorAtserias, Albert
dc.contributor.authorBonacina, Ilario
dc.contributor.authorRezende, Susanna F. de
dc.contributor.authorLauria, Massimo
dc.contributor.authorNordström, Jakob
dc.contributor.authorRazborov, Alexander
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned2018-10-29T10:41:31Z
dc.date.available2018-10-29T10:41:31Z
dc.date.issued2018
dc.identifier.citationAtserias, A., Bonacina, I., Rezende, S., Lauria, M., Nordström, J., Razborov, A. Clique is hard on average for regular resolution. A: ACM Symposium on Theory of Computing. "Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing". New York: Association for Computing Machinery (ACM), 2018, p. 866-877.
dc.identifier.isbn978-1-4503-5559-9
dc.identifier.urihttp://hdl.handle.net/2117/123124
dc.description.abstractWe prove that for k ≪4√n regular resolution requires length nΩ(k) to establish that an Erdős–Rényi graph with appropriately chosen edge density does not contain a k-clique. This lower bound is optimal up to the multiplicative constant in the exponent, and also implies unconditional nΩ(k) lower bounds on running time for several state-of-the-art algorithms for finding maximum cliques in graphs.
dc.format.extent12 p.
dc.language.isoeng
dc.publisherAssociation for Computing Machinery (ACM)
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat
dc.subject.lcshComputational complexity
dc.subject.lcshAlgorithms
dc.subject.otherProof complexity
dc.subject.otherRegular resolution
dc.subject.otherk-clique
dc.subject.otherErdos-Rényi random graphs
dc.titleClique is hard on average for regular resolution
dc.typeConference report
dc.subject.lemacComplexitat computacional
dc.subject.lemacAlgorismes
dc.contributor.groupUniversitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
dc.identifier.doi10.1145/3188745.3188856
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttps://dl.acm.org/citation.cfm?doid=3188745.3188856
dc.rights.accessOpen Access
local.identifier.drac23428260
dc.description.versionPostprint (author's final draft)
dc.relation.projectidinfo:eu-repo/grantAgreement/EC/H2020/648276/EU/A Unified Theory of Algorithmic Relaxations/AUTAR
local.citation.authorAtserias, A.; Bonacina, I.; Rezende, S.; Lauria, M.; Nordström, J.; Razborov, A.
local.citation.contributorACM Symposium on Theory of Computing
local.citation.pubplaceNew York
local.citation.publicationNameProceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing
local.citation.startingPage866
local.citation.endingPage877


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder