Revision as of 22:17, 6 May 2009 edit Jok2000 (talk \| contribs) Extended confirmed users 1,836 edits revert -- That's not even controversial, and is self-evident through simple algebra. ← Previous edit		Revision as of 15:17, 7 May 2009 edit undo Guarani.py (talk \| contribs) 24 edits No edit summary Next edit →
Line 135: N. Een and N. Sörensson, {{doi-inline\|10.1007/b95238\|An Extensible SAT-solver}}, in Satisfiability Workshop, 2003. D. Babić, J. Bingham, and A. J. Hu, {{doi-inline\|10.1109/TC.2006.175\|B-Cubing: New Possibilities for Efficient SAT-Solving}}, IEEE Transactions on Computers 55(11):1315–1324, 2006. *C. Rodríguez, M. Villagra and B. Barán, {{doi-inline\|10.1109/BIMNICS.2007.4610083\|Asynchronous team algorithms for Boolean Satisfiability}}, Bionetics2007, pp. 66-69, 2007. <references/>

Boolean satisfiability problem: Difference between revisions