Back to Results
First PageMeta Content
Theoretical computer science / Mathematics / Computational complexity theory / Electronic design automation / Formal methods / Logic in computer science / NP-complete problems / Boolean algebra / Satisfiability modulo theories / Boolean satisfiability problem / Linear programming / AMPL


SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers Germain Faure, Robert Nieuwenhuis, Albert Oliveras and Enric Rodr´ıguez-Carbonell? Abstract. Many highly sophisticated tools exist for
Add to Reading List

Document Date: 2008-05-08 10:37:46


Open Document

File Size: 246,90 KB

Share Result on Facebook