Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Philipp Nuspl"'
Publikováno v:
Journal of Symbolic Computation. 116:400-424
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7152b028d8d3048a30a134ff710865ff
https://doi.org/10.1016/j.jsc.2022.10.008
https://doi.org/10.1016/j.jsc.2022.10.008
Autor:
Philipp Nuspl, Veronika Pillwein
Publikováno v:
Computer Algebra in Scientific Computing ISBN: 9783031147876
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f750dad461d5a2ae31c4a48dae00ff70
https://doi.org/10.1007/978-3-031-14788-3_15
https://doi.org/10.1007/978-3-031-14788-3_15
Autor:
Philipp Nuspl, Veronika Pillwein
The class of $C^2$-finite sequences is a natural generalization of holonomic sequences and consists of sequences satisfying a linear recurrence with C-finite coefficients, i.e., coefficients satisfying a linear recurrence with constant coefficients t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5be5da4fad50f2b92820cd9f42c6c5c1
Publikováno v:
ISSAC
Holonomic sequences are widely studied as many objects interesting to mathematicians and computer scientists are in this class. In the univariate case, these are the sequences satisfying linear recurrences with polynomial coefficients and also referr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::62d1845223c4b651deddbfe4a09d4667
https://doi.org/10.1145/3452143.3465529
https://doi.org/10.1145/3452143.3465529
Autor:
Philipp Nuspl
Publikováno v:
Algebra universalis. 82
We investigate the complexity of solving systems of polynomial equations over finite groups. In 1999 Goldmann and Russell showed $$\mathrm {NP}$$ NP -completeness of this problem for non-Abelian groups. We show that the problem can become tractable f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8266199d98b53ace394b06d982638c77
https://doi.org/10.1007/s00012-020-00701-6
https://doi.org/10.1007/s00012-020-00701-6
Autor:
Nuspl, Philipp
In the past few decades, numerous tools for automatically discovering and proving identities involving sequences and special functions were developed. These tools are often based on algorithms which manipulate sequences satisfying linear recurrences.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3361::f33b2be34197b1f7b2622f72acd2a9fc
Autor:
Nuspl, Philipp
We investigate the complexity of solving systems of polynomial equations over finite groups. We give a survey on the known results for solving equations over general algebras, rings, fields and groups. In 1999 Goldmann and Russell showed that for non
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3361::9dcdc0054d72fd5d3bf17feb8479ad43
This volume convenes selected, peer-reviewed research and survey articles that address the modern state-of-the-art in varied areas of applied mathematical analysis. They primarily include presentations as well as invited contributions for the 1s
This book constitutes the proceedings of the 24th International Workshop on Computer Algebra in Scientific Computing, CASC 2022, which took place in Gebze, Turkey, in August 2022. The 20 full papers included in this book were carefully reviewed an