0559510 - MÚ 2023 RIV DE eng C - Conference Paper (international conference)
Khaniki, ErfanNisan-Wigderson generators in proof complexity: New lower bounds.
37th Computational Complexity Conference (CCC 2022). Dagstuhl: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2022 - (Lovett, S.), s. 1-15, č. článku 17. Leibniz International Proceedings in Informatics, 234. ISBN 978-3-95977-241-9. ISSN 1868-8969.
[37th Computational Complexity Conference (CCC 2022). Philadelphia (US), 20.07.2022-23.07.2022]
R&D Projects: GA ČR(CZ) GX19-27871X
Institutional support: RVO:67985840
Keywords : proof complexity * bounded arithmetic * bounded depth Frege * Nisan-Wigderson generators
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
https://dx.doi.org/10.4230/LIPIcs.CCC.2022.17
Permanent Link: https://hdl.handle.net/11104/0332787