![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 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](https://www.pdfsearch.io/img/6642e57ef5247e5e8505280a6852c870.jpg) Date: 2008-05-08 10:37:46Theoretical 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 ListSource URL: www.lsi.upc.eduDownload Document from Source Website File Size: 246,90 KBShare Document on Facebook
|