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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Applicable algebra in engineering, communication and computing Jg. 35; H. 2; S. 207 - 232
Hauptverfasser:	Barbagallo, María Laura, Jeronimo, Gabriela, Sabia, Juan
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2024 Springer Nature B.V
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!