Decision problem for a class of univariate Pfaffian functions

We address the decision problem for sentences involving univariate functions constructed from a fixed Pfaffian function of order 1. We present a new symbolic procedure solving this problem with a computable complexity based on the computation of suitable Sturm sequences. For a general Pfaffian funct...

Full description

Saved in:

Bibliographic Details
Published in:	Applicable algebra in engineering, communication and computing Vol. 35; no. 2; pp. 207 - 232
Main Authors:	Barbagallo, María Laura, Jeronimo, Gabriela, Sabia, Juan
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2024 Springer Nature B.V
Subjects:	Algebra Algorithms Artificial Intelligence Computation Computer Hardware Computer Science Estimates Original Paper Partial differential equations Polynomials Sequences Symbolic and Algebraic Manipulation Theory of Computation 68W30 Pfaffian functions 14P15 Decision problem Sturm sequences Complexity
ISSN:	0938-1279, 1432-0622
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!