Search: onr:"swepub:oai:DiVA.org:kth-244573" >
Clique Is Hard on A...
Clique Is Hard on Average for Regular Resolution
-
- Atserias, Albert (author)
- Univ Politecn Cataluna, Dept Comp Sci, Barcelona, Spain.
-
- Bonacina, Ilario (author)
- Univ Politecn Cataluna, Dept Comp Sci, Barcelona, Spain.
-
- de Rezende, Susanna F. (author)
- KTH,Skolan för elektroteknik och datavetenskap (EECS)
-
show more...
-
- Lauria, Massimo (author)
- Sapienza Univ Roma, Dept Stat Sci, Rome, Italy.
-
- Nordström, Jakob, 1972- (author)
- KTH,Skolan för elektroteknik och datavetenskap (EECS)
-
- Razborov, Alexander (author)
- Univ Chicago, Chicago, IL 60637 USA.;Steklov Math Inst, Moscow, Russia.
-
show less...
-
Univ Politecn Cataluna, Dept Comp Sci, Barcelona, Spain Skolan för elektroteknik och datavetenskap (EECS) (creator_code:org_t)
- 2018-06-20
- 2018
- English.
-
In: STOC'18. - New York, NY, USA : ASSOC COMPUTING MACHINERY. ; , s. 866-877
- Related links:
-
https://doi.org/10.1...
-
show more...
-
http://arxiv.org/pdf...
-
https://urn.kb.se/re...
-
https://doi.org/10.1...
-
show less...
Abstract
Subject headings
Close
- We prove that for k << (4)root n regular resolution requires length n(Omega(k)) to establish that an Erdos Renyi 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(Omega(k)) lower bounds on running time for several state-of-the-art algorithms for finding maximum cliques in graphs.
Subject headings
- NATURVETENSKAP -- Matematik -- Diskret matematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics -- Discrete Mathematics (hsv//eng)
Keyword
- Proof complexity
- regular resolution
- k-clique
- Erdos-Renyi random graphs
Publication and Content Type
- ref (subject category)
- kon (subject category)
To the university's database