<--- Back to Details
First PageDocument Content
Theoretical computer science / Mathematics / Computational complexity theory / Logic in computer science / Constraint programming / Electronic design automation / Formal methods / NP-complete problems / Satisfiability modulo theories / Boolean satisfiability problem / Solver / Maximum satisfiability problem
Date: 2008-04-24 09:03:36
Theoretical computer science
Mathematics
Computational complexity theory
Logic in computer science
Constraint programming
Electronic design automation
Formal methods
NP-complete problems
Satisfiability modulo theories
Boolean satisfiability problem
Solver
Maximum satisfiability problem

The Barcelogic SMT Solver (Tool Paper)? Miquel Bofill† , Robert Nieuwenhuis? , Albert Oliveras? , Enric Rodr´ıguez-Carbonell? and Albert Rubio? †

Add to Reading List

Source URL: www.lsi.upc.edu

Download Document from Source Website

File Size: 121,41 KB

Share Document on Facebook

Similar Documents

3 May 1998 ITERATED RANDOM FUNCTIONS Persi Diaconis Department of Mathematics & ORIE Cornell University

3 May 1998 ITERATED RANDOM FUNCTIONS Persi Diaconis Department of Mathematics & ORIE Cornell University

DocID: 1xVWv - View Document

SCAN 2018 Post-conference Proceedings Special Issue of Journal of Computational and Applied Mathematics Call for Papers Special Issue on the 18th International Symposium on Scientific Computing, Computer Arithmetic,

SCAN 2018 Post-conference Proceedings Special Issue of Journal of Computational and Applied Mathematics Call for Papers Special Issue on the 18th International Symposium on Scientific Computing, Computer Arithmetic,

DocID: 1xVSx - View Document

MATHEMATICS OF COMPUTATION Volume 00, Number 0, Pages 000–000 SXXBETTER POLYNOMIALS FOR GNFS SHI BAI, CYRIL BOUVIER, ALEXANDER KRUPPA, AND PAUL ZIMMERMANN

MATHEMATICS OF COMPUTATION Volume 00, Number 0, Pages 000–000 SXXBETTER POLYNOMIALS FOR GNFS SHI BAI, CYRIL BOUVIER, ALEXANDER KRUPPA, AND PAUL ZIMMERMANN

DocID: 1xVRE - View Document

A characterization of Riemann integrability Cosmin Burtea Faculty of Mathematics,

A characterization of Riemann integrability Cosmin Burtea Faculty of Mathematics, "Al. I. Cuza" University of Ia³i, Romania Abstract We prove a characterization of Riemann integrability by using some Darboux-like sums w

DocID: 1xVOd - View Document

Mathematics 7-12, BS

Mathematics 7-12, BS "DBEFNJD.BQ  5IF"DBEFNJD.BQTFSWFTBTBTVHHFTUFEDPVSTFTFRVFODFPOMZ4UVEFOUTBSFOPUMJNJUFEUPUIJTQMBOJUJTNFBOUUPCFVTFEBT

DocID: 1xVH0 - View Document