Quantifier elimination for a class of exponential polynomial formulas
From MaRDI portal
Publication:480651
DOI10.1016/j.jsc.2014.09.015zbMath1382.03056OpenAlexW2054225417MaRDI QIDQ480651
Publication date: 9 December 2014
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2014.09.015
quantifier eliminationinterval arithmeticcylindrical algebraic decompositionexponential polynomialsdecision procedures
Symbolic computation and algebraic computation (68W30) Computational aspects of higher-dimensional varieties (14Q15) Quantifier elimination, model completeness, and related topics (03C10)
Related Items (5)
Positive root isolation for poly-powers by exclusion and differentiation ⋮ Isolating all the real roots of a mixed trigonometric-polynomial ⋮ Decision problem for a class of univariate Pfaffian functions ⋮ A conflict-driven solving procedure for poly-power constraints ⋮ Exact solutions in log-concave maximum likelihood estimation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Variant quantifier elimination
- Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
- Cylindrical decomposition for systems transcendental in the first variable
- Deciding polynomial-transcendental problems
- A complete discrimination system for polynomials
- Quantifier elimination for real algebra -- the quadratic case and beyond
- The complexity of linear problems in fields
- An improved projection operation for cylindrical algebraic decomposition of three-dimensional space
- Partial cylindrical algebraic decomposition for quantifier elimination
- How to recognize zero?
- Recent advances on determining the number of real roots of parametric polynomials
- Fourier-Motzkin elimination and its dual
- A new decision method for elementary algebra
- Variant real quantifier elimination
- Real root isolation for tame elementary functions
- Reachability analysis of rational eigenvalue linear systems
- QEPCAD B
- Cylindrical Algebraic Decomposition I: The Basic Algorithm
- Deciding polynomial-exponential problems
- Polynomial Remainder Sequences and Determinants
- Decision procedures for real and p‐adic fields
- On Euclid's Algorithm and the Theory of Subresultants
- Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function
- Algorithms in real algebraic geometry
- Improved projection for cylindrical algebraic decomposition
This page was built for publication: Quantifier elimination for a class of exponential polynomial formulas
