doi:j.ipl

First Page		Document Content
Date: 2008-03-02 23:12:13 Automated theorem proving NP-complete problems Unit propagation 2-satisfiability Time complexity Variable MAX-3SAT (SAT ε-UNSAT) Theoretical computer science Mathematics Computational complexity theory		doi:j.ipl Add to Reading List Source URL: www.cc.ntut.edu.tw Download Document from Source Website File Size: 126,13 KB Share Document on Facebook

	Optimizing S-box Implementations for Several Criteria using SAT Solvers Ko Stoffelen Goal DocID: 1xVCk - View Document
	Bounded Model Generation for Isabelle/HOL Using a SAT Solver Tjark Weber DocID: 1xVzf - View Document
	Optimizing S-box Implementations for Several Criteria using SAT Solvers Ko Stoffelen Radboud University, Digital Security, Nijmegen, The Netherlands DocID: 1xVyX - View Document
	Integrating a SAT Solver with an LCF-style Theorem Prover A Fast Decision Procedure for Propositional Logic for the Isabelle System Tjark Weber DocID: 1xVu1 - View Document
	Integrating a SAT Solver with Isabelle/HOL Tjark Weber (joint work with Alwen Tiu et al.) First Munich-Nancy Workshop on DocID: 1xUVp - View Document