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 the complexity of Gröbner bases conversion

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

DOI10.1006/jsco.1998.0276zbMath0939.68170OpenAlexW2056982721MaRDI QIDQ1808671

Michael Kalkbrener

Publication date: 25 November 1999

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1998.0276


zbMATH Keywords

Gröbner bases


Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)


Related Items

Gröbner systems conversion ⋮ Change of order for regular chains in positive dimension ⋮ Computing Gröbner fans ⋮ A fast algorithm for Gröbner basis conversion and its applications



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