Fast simplifications for Tarski formulas based on monomial inequalities
From MaRDI portal
Publication:420752
DOI10.1016/j.jsc.2011.12.012zbMath1262.68189OpenAlexW2001248074MaRDI QIDQ420752
Publication date: 23 May 2012
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2011.12.012
Symbolic computation and algebraic computation (68W30) Combinatorial inequalities (05A20) Computation over the reals, computable analysis (03D78)
Related Items (5)
Real quantifier elimination for the synthesis of optimal numerical algorithms (case study: square root computation) ⋮ Computing with Tarski formulas and semi-algebraic sets in a web browser ⋮ A Simple Quantifier-Free Formula of Positive Semidefinite Cyclic Ternary Quartic Forms ⋮ From simplification to a partial theory solver for non-linear real polynomial constraints ⋮ Special algorithm for stability analysis of multistable biological regulatory systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantifier elimination for real algebra -- the quadratic case and beyond
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- Quantifier elimination and cylindrical algebraic decomposition. Proceedings of a symposium, Linz, Austria, October 6--8, 1993
- Simplification of quantifier-free formulae over ordered fields
- Fast simplifications for Tarski formulas
- Black-box/white-box simplification and applications to quantifier elimination
- New results on quantifier elimination over real closed fields and applications to constraint databases
- The Complexity of Boolean Formula Minimization
- On the inherent intractability of certain coding problems (Corresp.)
- Computational Science - ICCS 2004
- Triangular decomposition of semi-algebraic systems
- Simple CAD construction and its applications
This page was built for publication: Fast simplifications for Tarski formulas based on monomial inequalities