Back to Results
First PageMeta Content
Theoretical 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 List

Document Date: 2014-05-28 10:18:30

Open Document

File Size: 137,17 KB

Share Result on Facebook
UPDATE