Skip to search formSkip to main contentSkip to account menu

Gröbner basis

Known as: Multivariate division algorithm, Gröbner bases, Gröbner base 
In mathematics, and more specifically in computer algebra, computational algebraic geometry, and computational commutative algebra, a Gröbner basis… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
We prove that the polynomial form of the scattering equations is a Macaulay H-basis. We demonstrate that this H-basis facilitates… 
2012
2012
Let S be a subdivision of the plane into polygonal regions, where each region has an associated positive weight. The weighted… 
2008
2008
This paper explores how to use the concept of mutants in the computation of a Gröbner basis for polynomial equations. We compare… 
2004
2004
This paper compares the XL algorithm with Grobner basis algorithm. We explain the link between XL computation result and Grobner… 
1998
1998
This paper discusses the processing of non-linear polynomial systems using a branch and prune algorithm within the framework of… 
1998
1998
A sufficient condition for C1-continuity of subdivision surfaces was proposed by Reif [Comput. Aided Geom. Design, 12 (1995), pp… 
1993
1993
Grobner bases are fundamental tools for effective computations in polynomial ideel theory; they allow to solve the ideal… 
1992
1992
The problem of eliminating variables from a set of polynomial equations arises in many symbolic and numeric applications. The… 
1991
1991
Grobner Bases are a mathematical tool that has received considerable attention in recent years. Since the Buchberger Algorithm… 
1990
1990
The attempt to solve systems of polynomial equations with Grobner base techniques often leads to large problems which exceed the…