Efficient Preprocessing Methods for Quantifier Elimination

DOI10.1007/11870814_7MaRDI QIDQ3511099zbMATH OpenOpenAlexFDO

Authors Christopher W. Brown, Christian Gross

Publication date 4 July 2008

Published in Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11870814_7

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Quantifier elimination, model completeness, and related topics (03C10)

Recommendations

• Quantifier elimination for real algebra -- the quadratic case and beyond
• Quantifier Elimination for Formulas Constrained by Quadratic Equations via Slope Resultants
• Efficient subformula orders for real quantifier elimination of non-prenex formulas
• scientific article; zbMATH DE number 1302474
• Quantifier elimination for a class of exponential polynomial formulas

Cited in

(5)

• Efficient subformula orders for real quantifier elimination of non-prenex formulas
• A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications
• Automatic generation of bounds for polynomial systems with application to the Lorenz system
• Investigating Generic Methods to Solve Hopf Bifurcation Problems in Algebraic Biology
• Faster one block quantifier elimination for regular polynomial systems of equations

Describes a project that uses

Uses Software

• REDLOG
• QEPCAD

This page was built for publication: Efficient Preprocessing Methods for Quantifier Elimination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3511099)