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… 
2010
2010
Summary In this paper we use GrÖbner bases to explore the inherent structure of Sudoku puzzles and boards. In particular, we… 
2010
2010
We introduce the Macaulay2 package BooleanGB, which computes a Gr\"obner basis for Boolean polynomials using a binary… 
Highly Cited
1995
Highly Cited
1995
Any linear code with a nontrivial automorphism has the structure of a module over a polynomial ring. The theory of Grobner bases… 
1993
1993
Grobner bases are fundamental tools for effective computations in polynomial ideel theory; they allow to solve the ideal… 
Highly Cited
1993
Highly Cited
1993
Grobner bases and Buchberger's algorithm have been generalized to monoid and group rings. In this paper we summarize procedures… 
1990
1990
The attempt to solve systems of polynomial equations with Grobner base techniques often leads to large problems which exceed the… 
1987
1987
the set T A of all monomlals in R, such that it is compatible with O. Given a finetely A-generated A-ideal I in R, i.e. an ideal…