Minimum 2CNF Resolution Refutations in Polynomial Time
From MaRDI portal
Publication:3612473
DOI10.1007/978-3-540-72788-0_29zbMath1214.68345OpenAlexW1588707965MaRDI QIDQ3612473
No author found.
Publication date: 10 March 2009
Published in: Theory and Applications of Satisfiability Testing – SAT 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-72788-0_29
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Integer feasibility and refutations in UTVPI constraints using bit-scaling ⋮ The incremental satisfiability problem for a two conjunctive normal form
This page was built for publication: Minimum 2CNF Resolution Refutations in Polynomial Time
