Košík

0523286 - MÚ 2020 RIV US eng C - Konferenční příspěvek (zahraniční konf.)
Pich, Ján - Santhanamz, R.
Why are proof complexity lower bounds hard?
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS 2019). Los Alamitos: IEEE, 2019, s. 1305-1324. Annual IEEE Symposium on Foundations of Computer Science. ISBN 978-1-7281-4952-3. ISSN 0272-5428.
[60th IEEE Annual Symposium on Foundations of Computer Science (FOCS). Baltimore (US), 09.11.2019-12.11.2019]
Grant CEP: GA ČR(CZ) GA19-05497S
Institucionální podpora: RVO:67985840
Klíčová slova: computational complexity * proof complexity * circuit lower bounds
Obor OECD: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
https://ieeexplore.ieee.org/document/8948624
Trvalý link: http://hdl.handle.net/11104/0307653