0491873 - MÚ 2019 RIV CH eng C - Conference Paper (international conference)
Galesi, N. - Talebanfard, Navid - Torán, J.Cops-Robber games and the resolution of Tseitin formulas.
Theory and Applications of Satisfiability Testing – SAT 2018. Cham: Springer, 2018 - (Beyersdorff, O.; Wintersteiger, C.), s. 311-326. Lecture Notes in Computer Science, 10929. ISBN 978-3-319-94143-1. ISSN 0302-9743.
[21st International Conference, SAT 2018. Oxford (GB), 09.07.2018-12.07.2018]
EU Projects: European Commission(XE) 339691 - FEALORA
Institutional support: RVO:67985840
Keywords : formal logic * computer circuits
OECD category: 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-319-94144-8_19
Permanent Link: http://hdl.handle.net/11104/0285479
