Fast simplifications for Tarski formulas based on monomial inequalities
From MaRDI portal
Publication:420752
DOI10.1016/J.JSC.2011.12.012zbMATH Open1262.68189OpenAlexW2001248074MaRDI QIDQ420752FDOQ420752
Authors: Christopher W. Brown 
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
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
Symbolic computation and algebraic computation (68W30) Computation over the reals, computable analysis (03D78) Combinatorial inequalities (05A20)
Cites Work
- Quantifier elimination and cylindrical algebraic decomposition. Proceedings of a symposium, Linz, Austria, October 6--8, 1993
- Title not available (Why is that?)
- On the inherent intractability of certain coding problems (Corresp.)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Quantifier elimination for real algebra -- the quadratic case and beyond
- Black-box/white-box simplification and applications to quantifier elimination
- Triangular decomposition of semi-algebraic systems
- New results on quantifier elimination over real closed fields and applications to constraint databases
- Fast simplifications for Tarski formulas
- The Complexity of Boolean Formula Minimization
- Title not available (Why is that?)
- Computational Science - ICCS 2004
- Simple CAD construction and its applications
Cited In (7)
- A simple quantifier-free formula of positive semidefinite cyclic ternary quartic forms
- Black-box/white-box simplification and applications to quantifier elimination
- Computing with Tarski formulas and semi-algebraic sets in a web browser
- Real quantifier elimination for the synthesis of optimal numerical algorithms (case study: square root computation)
- Special algorithm for stability analysis of multistable biological regulatory systems
- Fast simplifications for Tarski formulas
- From simplification to a partial theory solver for non-linear real polynomial constraints
Uses Software
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)
