Deciding polynomial-exponential problems

DOI10.1145/1390768.1390799zbMath1236.68301OpenAlexW1970473241MaRDI QIDQ5301626

Volker Weispfenning, Melanie Achatz, Scott McCallum

Publication date: 20 January 2009

Published in: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1390768.1390799

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Decidability of theories and sets of sentences (03B25) Quantifier elimination, model completeness, and related topics (03C10)

Related Items (14)

Recent Advances in Real Geometric Reasoning ⋮ Positive root isolation for poly-powers by exclusion and differentiation ⋮ Isolating all the real roots of a mixed trigonometric-polynomial ⋮ Deciding first-order formulas involving univariate mixed trigonometric-polynomials ⋮ Automated proof of mixed trigonometric-polynomial inequalities ⋮ Decision problem for a class of univariate Pfaffian functions ⋮ Time-bounded termination analysis for probabilistic programs with delays ⋮ Cylindrical decomposition for systems transcendental in the first variable ⋮ Deciding polynomial-transcendental problems ⋮ Quantifier elimination for a class of exponential polynomial formulas ⋮ Algorithmic global criteria for excluding oscillations ⋮ Reachability analysis of rational eigenvalue linear systems ⋮ A conflict-driven solving procedure for poly-power constraints ⋮ Tropical varieties for exponential sums

This page was built for publication: Deciding polynomial-exponential problems