Computing with Tarski formulas and semi-algebraic sets in a web browser

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Fast simplifications for Tarski formulas based on monomial inequalities
On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
Simplification of quantifier-free formulae over ordered fields
Polynomial constraints and unsat cores in \textsc{Tarski}
Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings
Cylindrical algebraic decomposition using validated numerics
An Incremental Algorithm for Computing Cylindrical Algebraic Decompositions
Giac and GeoGebra – Improved Gröbner Basis Computations
$$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation
Solving Non-linear Arithmetic
Black-box/white-box simplification and applications to quantifier elimination
New results on quantifier elimination over real closed fields and applications to constraint databases
Efficient projection orders for CAD
Automated reasoning tools in GeoGebra discovery
CAD Adjacency Computation Using Validated Numerics
Thirty Years of Virtual Substitution
Comparison of CAD-based Methods for Computation of Rational Function Limits
Cylindrical Algebraic Decomposition I: The Basic Algorithm
Solving polynomial systems over semialgebraic sets represented by cylindrical algebraic formulas
Applying Machine Learning to the Problem of Choosing a Heuristic to Select the Variable Ordering for Cylindrical Algebraic Decomposition
Quantifier elimination by cylindrical algebraic decomposition based on regular chains
Is computer algebra ready for conjecturing and proving geometric inequalities in the classroom?

This page was built for publication: Computing with Tarski formulas and semi-algebraic sets in a web browser