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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Applicable algebra in engineering, communication and computing Ročník 35; číslo 2; s. 207 - 232
Hlavní autori:	Barbagallo, María Laura, Jeronimo, Gabriela, Sabia, Juan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2024 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!