Deciding polynomial-transcendental problems
From MaRDI portal
Publication:654031
DOI10.1016/J.JSC.2011.08.009zbMATH Open1243.03015OpenAlexW2015314684MaRDI QIDQ654031FDOQ654031
Scott McCallum, Volker Weispfenning
Publication date: 21 December 2011
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2011.08.009
Recommendations
- Deciding polynomial-exponential problems
- scientific article; zbMATH DE number 1574496
- scientific article; zbMATH DE number 1948385
- scientific article; zbMATH DE number 3924142
- Undecidability of Parametric Solutions of Polynomial Equations
- Publication:4863285
- On polynomial estimations with transcendental numbers
- Integer transfinite diameter and computation of polynomials
- The hardness of polynomial equation solving
- scientific article; zbMATH DE number 3932433
Symbolic computation and algebraic computation (68W30) Decidability of theories and sets of sentences (03B25)
Cites Work
- On the Lambert \(w\) function
- Quantifier elimination and cylindrical algebraic decomposition. Proceedings of a symposium, Linz, Austria, October 6--8, 1993
- Title not available (Why is that?)
- Robust multi-objective feedback design by quantifier elimination
- Testing stability by quantifier elimination
- Cylindrical algebraic decomposition using validated numerics
- Nonlinear control system design by quantifier elimination
- Real root isolation for tame elementary functions
- Deciding polynomial-exponential problems
- Title not available (Why is that?)
- Generalized Budan--Fourier theorem and virtual roots
- Computing in the field of complex algebraic numbers
- Virtual roots of real polynomials
Cited In (16)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exact solutions in log-concave maximum likelihood estimation
- Handling polynomial and transcendental functions in SMT via unconstrained optimisation and topological degree test
- Reachability analysis of linear systems
- Isolating all the real roots of a mixed trigonometric-polynomial
- NIL: learning nonlinear interpolants
- Deciding first-order formulas involving univariate mixed trigonometric-polynomials
- Decision problem for a class of univariate Pfaffian functions
- On the zeros of univariate E-polynomials
- Quantifier elimination for a class of exponential polynomial formulas
- Automated proof of mixed trigonometric-polynomial inequalities
- A conflict-driven solving procedure for poly-power constraints
- Positive root isolation for poly-powers by exclusion and differentiation
- On the set of reduced states of translation invariant, infinite quantum systems
- Zero counting for a class of univariate Pfaffian functions
Uses Software
This page was built for publication: Deciding polynomial-transcendental problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q654031)
