10 citations · 11 across the 6 of their papers we have counts for
3 papers · 1 filter
More is Less: Adding Polynomials for Faster Explanations in NLSAT
Valentin Promies, Jasper Nalbach, Erika Ábrahám +1
To check the satisfiability of (non-linear) real arithmetic formulas, modern satisfiability modulo theories (SMT) solving algorithms like NLSAT depend heavily on single cell constr…
Projective Delineability for Single Cell Construction
Jasper Nalbach, Lucas Michel, Erika Ábrahám +5
The cylindrical algebraic decomposition (CAD) is the only complete method used in practice for solving problems like quantifier elimination or SMT solving related to real algebra,…
A Variant of Non-uniform Cylindrical Algebraic Decomposition for Real Quantifier Elimination
Jasper Nalbach, Erika Ábrahám
The Cylindrical Algebraic Decomposition (CAD) method is currently the only complete algorithm used in practice for solving real-algebraic problems. To ameliorate its doubly-exponen…