Decision problem for a class of univariate Pfaffian functions

DOI10.1007/s00200-022-00545-8arXiv1905.10882OpenAlexW2945709428MaRDI QIDQ6122406

María Laura Barbagallo, Juan Sabia, Gabriela Jeronimo

Publication date: 1 March 2024

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.10882

zbMATH Keywords

complexitydecision problemPfaffian functionsSturm sequences

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Real-analytic and semi-analytic sets (14P15)

Related Items (1)

On the zeros of univariate E-polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantifier elimination for a class of exponential polynomial formulas
• Linear solving for sign determination
• Deciding polynomial-transcendental problems
• The complexity of deciding consistency of systems of polynomials in exponent inequalities
• Finding irreducible components of some real transcendental varieties
• Complexity bounds for zero-test algorithms
• Improved Algorithms for Sign Determination and Existential Quantifier Elimination
• Deciding linear-trigonometric problems
• Deciding polynomial-exponential problems
• Integer Arithmetic Algorithms for Polynomial Real Zero Determination
• Algorithms in real algebraic geometry
• Zero counting for a class of univariate Pfaffian functions

This page was built for publication: Decision problem for a class of univariate Pfaffian functions