0476174 - MÚ 2018 RIV DE eng C - Conference Paper (international conference)
Pudlák, Pavel - Scheder, D. - Talebanfard, NavidTighter Hard Instances for PPSZ.
44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Dagstuhl: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2017 - (Chatzigiannakis, I.; Indyk, P.; Kuhn, F.; Muscholl, A.), s. 1-13, č. článku 85. Leibniz International Proceedings in Informatics, 80. ISBN 978-3-95977-041-5. ISSN 1868-8969.
[44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Warsaw (PL), 10.07.2017-14.07.2017]
R&D Projects: GA ČR GBP202/12/G061
Institutional support: RVO:67985840
Keywords : k-SAT * strong exponential time hypothesis * PPSZ * resolution
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=7414
Permanent Link: http://hdl.handle.net/11104/0272702
