0507739 - MÚ 2020 RIV CH eng C - Konferenční příspěvek (zahraniční konf.)
Buss, S. - Thapen, NeilDRAT proofs, propagation redundancy, and extended resolution.
Theory and Applications of Satisfiability Testing – SAT 2019. Cham: Springer, 2019 - (Janota, M.; Lynce, I.), s. 71-89. Lecture Notes in Computer Science, 11628. ISBN 978-3-030-24257-2. ISSN 0302-9743.
[22nd International Conference on Theory and Applications of Satisfiability Testing (SAT 2019). Lisbon (PT), 09.07.2019-12.07.2019]
Grant CEP: GA ČR(CZ) GA19-05497S
GRANT EU: European Commission(XE) 339691 - FEALORA
Institucionální podpora: RVO:67985840
Klíčová slova: lower bounds * proof complexity
Obor OECD: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
https://link.springer.com/chapter/10.1007%2F978-3-030-24258-9_5
Trvalý link: http://hdl.handle.net/11104/0298715
