Deciding polynomial-exponential problems

DOI10.1145/1390768.1390799MaRDI QIDQ5301626zbMATH OpenOpenAlexFDO

Authors Melanie Achatz, Scott McCallum, Volker Weispfenning

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

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

Recommendations

• Deciding polynomial-transcendental problems
• scientific article; zbMATH DE number 16666
• scientific article; zbMATH DE number 4157784
• The complexity of deciding consistency of systems of polynomials in exponent inequalities
• A note on the decidability of exponential terms

Cited in

(26)

• Real addition and the polynomial hierarchy
• Automated proof of mixed trigonometric-polynomial inequalities
• Time-bounded termination analysis for probabilistic programs with delays
• A conflict-driven solving procedure for poly-power constraints
• Positive root isolation for poly-powers by exclusion and differentiation
• scientific article; zbMATH DE number 1574496 (Why is no real title available?)
• Reachability analysis of rational eigenvalue linear systems
• Recent advances in real geometric reasoning
• Deciding linear-trigonometric problems
• A normal form for restricted exponential functions
• scientific article; zbMATH DE number 1863392 (Why is no real title available?)
• Quantifier elimination for a class of exponential polynomial formulas
• A decision procedure for univariate polynomial systems based on root counting and interval subdivision
• Algorithmic global criteria for excluding oscillations
• Isolating all the real roots of a mixed trigonometric-polynomial
• Deciding first-order formulas involving univariate mixed trigonometric-polynomials
• Decision problem for a class of univariate Pfaffian functions
• Cylindrical decomposition for systems transcendental in the first variable
• A probabilistic logic for verifying continuous-time Markov chains
• Automated tail bound analysis for probabilistic recurrence relations
• Deciding polynomial-transcendental problems
• Reachability analysis of linear systems
• A sample-driven solving procedure for the repeated reachability of quantum continuous-time Markov chains
• Reduction of transcendental decision problems over the reals
• On the existential theory of the reals enriched with integer powers of a computable number
• Tropical varieties for exponential sums

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

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