Krajíček, Jan
A note on SAT algorithms and proof complexity.
Information Processing Letters. Roč. 112, č. 12 (2012), s. 490-493. ISSN 0020-0190. E-ISSN 1872-6119
R&D Projects: GA AV ČR IAA100190902
Impact factor: 0.488, year: 2012 ; AIS: 0.454, rok: 2012
Result website:
http://www.sciencedirect.com/science/article/pii/S0020019012000774DOI: https://doi.org/10.1016/j.ipl.2012.03.009
http://hdl.handle.net/11104/0211194