Quantifier elimination for a class of exponential polynomial formulas
From MaRDI portal
Recommendations
- Quantifier elimination by cylindrical algebraic decomposition based on regular chains
- Quantifier Elimination via Functional Composition
- Quantifier elimination for real algebra -- the quadratic case and beyond
- The complexity of quantifier elimination and cylindrical algebraic decomposition
- On the combinatorial and algebraic complexity of quantifier elimination
Cites work
- A complete discrimination system for polynomials
- A new decision method for elementary algebra
- Algorithms in real algebraic geometry
- An improved projection operation for cylindrical algebraic decomposition of three-dimensional space
- Cylindrical Algebraic Decomposition I: The Basic Algorithm
- Cylindrical decomposition for systems transcendental in the first variable
- Deciding polynomial-exponential problems
- Deciding polynomial-transcendental problems
- Decision procedures for real and p‐adic fields
- Fourier-Motzkin elimination and its dual
- How to recognize zero?
- scientific article; zbMATH DE number 5850072 (Why is no real title available?)
- scientific article; zbMATH DE number 3711282 (Why is no real title available?)
- scientific article; zbMATH DE number 3465382 (Why is no real title available?)
- scientific article; zbMATH DE number 3497890 (Why is no real title available?)
- scientific article; zbMATH DE number 1262451 (Why is no real title available?)
- scientific article; zbMATH DE number 1273671 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 3199823 (Why is no real title available?)
- scientific article; zbMATH DE number 3068536 (Why is no real title available?)
- Improved projection for cylindrical algebraic decomposition
- Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function
- On Euclid's Algorithm and the Theory of Subresultants
- Partial cylindrical algebraic decomposition for quantifier elimination
- Polynomial Remainder Sequences and Determinants
- QEPCAD B
- Quantifier elimination for real algebra -- the quadratic case and beyond
- Reachability analysis of rational eigenvalue linear systems
- Real root isolation for exp-log functions
- Real root isolation for tame elementary functions
- Recent advances on determining the number of real roots of parametric polynomials
- The complexity of linear problems in fields
- Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
- Variant quantifier elimination
- Variant real quantifier elimination: algorithm and application
Cited in
(12)- Quantifier elimination for trigonometric polynomials by cylindrical trigonometric decomposition
- A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications
- Exact solutions in log-concave maximum likelihood estimation
- A conflict-driven solving procedure for poly-power constraints
- Positive root isolation for poly-powers by exclusion and differentiation
- Efficient Preprocessing Methods for Quantifier Elimination
- Quantifier Elimination via Functional Composition
- An effective implementation of a special quantifier elimination for a sign definite condition by logical formula simplification
- Isolating all the real roots of a mixed trigonometric-polynomial
- Decision problem for a class of univariate Pfaffian functions
- Reachability analysis of linear systems
- Reduction of transcendental decision problems over the reals
This page was built for publication: Quantifier elimination for a class of exponential polynomial formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q480651)
