Date: 2014-05-28 10:18:30Theoretical computer science Computational complexity theory Mathematical logic Constraint programming Logic in computer science Electronic design automation Formal methods NP-complete problems Boolean satisfiability problem Satisfiability modulo theories Maximum satisfiability problem Local consistency | | Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions⋆ Daniel Larraz, Albert Oliveras, Enric Rodr´ıguez-Carbonell, and Albert Rubio Universitat Polit`ecnica de Catalunya, Barcelona, Spain Add to Reading ListSource URL: www.lsi.upc.eduDownload Document from Source Website File Size: 137,17 KBShare Document on Facebook
|