Fast simplifications for Tarski formulas based on monomial inequalities
From MaRDI portal
Recommendations
- Fast simplifications for Tarski formulas
- Black-box/white-box simplification and applications to quantifier elimination
- Polynomial constraints and unsat cores in \textsc{Tarski}
- Complexity of deciding Tarski algebra
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
Cites work
- scientific article; zbMATH DE number 3566230 (Why is no real title available?)
- scientific article; zbMATH DE number 1263359 (Why is no real title available?)
- scientific article; zbMATH DE number 1559526 (Why is no real title available?)
- scientific article; zbMATH DE number 3068536 (Why is no real title available?)
- Black-box/white-box simplification and applications to quantifier elimination
- Computational Science - ICCS 2004
- Fast simplifications for Tarski formulas
- New results on quantifier elimination over real closed fields and applications to constraint databases
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- On the inherent intractability of certain coding problems (Corresp.)
- Quantifier elimination and cylindrical algebraic decomposition. Proceedings of a symposium, Linz, Austria, October 6--8, 1993
- Quantifier elimination for real algebra -- the quadratic case and beyond
- Simple CAD construction and its applications
- Simplification of quantifier-free formulae over ordered fields
- The Complexity of Boolean Formula Minimization
- Triangular decomposition of semi-algebraic systems
Cited in
(7)- Special algorithm for stability analysis of multistable biological regulatory systems
- Black-box/white-box simplification and applications to quantifier elimination
- Fast simplifications for Tarski formulas
- A simple quantifier-free formula of positive semidefinite cyclic ternary quartic forms
- Computing with Tarski formulas and semi-algebraic sets in a web browser
- From simplification to a partial theory solver for non-linear real polynomial constraints
- Real quantifier elimination for the synthesis of optimal numerical algorithms (case study: square root computation)
This page was built for publication: Fast simplifications for Tarski formulas based on monomial inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q420752)
