Super strong ETH is true for PPSZ with small resolution width
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F20%3A00531883" target="_blank" >RIV/67985840:_____/20:00531883 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.4230/LIPIcs.CCC.2020.3" target="_blank" >http://dx.doi.org/10.4230/LIPIcs.CCC.2020.3</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.4230/LIPIcs.CCC.2020.3" target="_blank" >10.4230/LIPIcs.CCC.2020.3</a>
Alternative languages
Result language
angličtina
Original language name
Super strong ETH is true for PPSZ with small resolution width
Original language description
We construct k-CNFs with m variables on which the strong version of PPSZ k-SAT algorithm, which uses resolution of width bounded by O(√log log m), has success probability at most 2−(1−(1+ε)2/k)m for every ε > 0. Previously such a bound was known only for the weak PPSZ algorithm which exhaustively searches through small subformulas of the CNF to see if any of them forces the value of a given variable, and for strong PPSZ the best known previous upper bound was 2−(1−O(log(k)/k))m (Pudlák et al., ICALP 2017).
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GX19-27871X" target="_blank" >GX19-27871X: Efficient approximation algorithms and circuit complexity</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
35th Computational Complexity Conference (CCC 2020)
ISBN
978-3-95977-156-6
ISSN
1868-8969
e-ISSN
—
Number of pages
12
Pages from-to
3
Publisher name
Schloss Dagstuhl, Leibniz-Zentrum für Informatik
Place of publication
Dagstuhl
Event location
Saarbrücken
Event date
Jul 28, 2020
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—