Number of the records: 1  

A note on SAT algorithms and proof complexity

  1. 1.
    KRAJÍČEK, J. A note on SAT algorithms and proof complexity. Information Processing Letters. 2012, 112(12), 490-493. ISSN 0020-0190. E-ISSN 1872-6119. Available: https://doi.org/10.1016/j.ipl.2012.03.009.
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.