A Note on Dynamic Gröbner Bases Computation (Q2830005)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	A Note on Dynamic Gröbner Bases Computation	scientific article

Statements

scholarly article

0 references

A Note on Dynamic Gröbner Bases Computation (English)

0 references

0 references

Delaram Talaashrafi

0 references

Computer Algebra in Scientific Computing

0 references

publication date

9 November 2016

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-45641-6_18

0 references

0 references

0 references

0 references

Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German

0 references

0 references

Reducing the size and number of linear programs in a dynamic Gröbner basis algorithm

0 references

0 references

A new efficient algorithm for computing Gröbner bases \((F_4)\)

0 references

0 references

0 references

On an installation of Buchberger's algorithm

0 references

0 references

A Singular Introduction to Commutative Algebra

0 references

Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases

0 references

0 references

The Gröbner fan of an ideal

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-45641-6_18

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2830005

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2830005&oldid=36286360"