0531886 - MÚ 2021 RIV DE eng C - Conference Paper (international conference)
de Rezende, Susanna F. - Nordstöm, J. - Risse, K. - Sokolov, D.Exponential resolution lower bounds for weak pigeonhole principle and perfect matching formulas over sparse graphs.
35th Computational Complexity Conference (CCC 2020). Dagstuhl: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2020 - (Shubhangi, S.), č. článku 28. Leibniz International Proceedings in Informatics, 169. ISBN 978-3-95977-156-6. ISSN 1868-8969.
[35th Computational Complexity Conference (CCC 2020). Saarbrücken (DE), 28.07.2020-31.07.2020]
Institutional support: RVO:67985840
Keywords : proof complexity * resolution * weak pigeonhole principle * perfect matching * sparse graphs
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
https://doi.org/10.4230/LIPIcs.CCC.2020.28
Permanent Link: http://hdl.handle.net/11104/0310520
