Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On an algorithmic optimization in computation of involutive bases

From MaRDI portal
Publication:1403223
Jump to:navigation, search

DOI10.1023/A:1014816631983zbMath1037.68063MaRDI QIDQ1403223

Vladimir P. Gerdt

Publication date: 1 September 2003

Published in: Programming and Computer Software (Search for Journal in Brave)


zbMATH Keywords

minimal involutive basis


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)


Related Items (5)

Algorithmic Thomas decomposition of algebraic and differential systems ⋮ Involutive bases algorithm incorporating F\(_5\) criterion ⋮ Combinatorial decompositions for monomial ideals ⋮ Parallel computation of Janet and Gröbner bases over rational numbers ⋮ A combinatorial approach to involution and \(\delta \)-regularity. I: Involutive bases in polynomial algebras of solvable type




This page was built for publication: On an algorithmic optimization in computation of involutive bases

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1403223&oldid=13567357"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 16:21.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki