Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,367,664 papers from all fields of science
Search
Sign In
Create Free Account
Gröbner basis
Known as:
Multivariate division algorithm
, Gröbner bases
, Gröbner base
Expand
In mathematics, and more specifically in computer algebra, computational algebraic geometry, and computational commutative algebra, a Gröbner basis…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
36 relations
Buchberger's algorithm
Computer algebra system
Confluence (abstract rewriting)
Dimension of an algebraic variety
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
The polynomial form of the scattering equations is an H -basis
J. Bosma
,
Mads Søgaard
,
Yang Zhang
2016
Corpus ID: 119134815
We prove that the polynomial form of the scattering equations is a Macaulay H-basis. We demonstrate that this H-basis facilitates…
Expand
2012
2012
Unsolvability of the Weighted Region Shortest Path Problem I
J. Carufel
,
Carsten Grimm
,
A. Maheshwari
,
M. Owen
,
M. Smid
2012
Corpus ID: 8480771
Let S be a subdivision of the plane into polygonal regions, where each region has an associated positive weight. The weighted…
Expand
2008
2008
Mutant Gröbner Basis Algorithm
Jintai Ding
,
Daniel Cabarcas
,
Dieter Schmidt
,
J. Buchmann
,
Stefan O. Tohaneanu
2008
Corpus ID: 15151336
This paper explores how to use the concept of mutants in the computation of a Gröbner basis for polynomial equations. We compare…
Expand
2004
2004
Comparison of XL and Gröbner basis algorithms over Finite Fields
J. Faugère
,
G. Ars
2004
Corpus ID: 124538610
This paper compares the XL algorithm with Grobner basis algorithm. We explain the link between XL computation result and Grobner…
Expand
1998
1998
A Symbolic-Numerical Branch and Prune Algorithm for Solving Non-linear Polynomial Systems
Laurent Granvilliers
Journal of universal computer science (Online)
1998
Corpus ID: 18837157
This paper discusses the processing of non-linear polynomial systems using a branch and prune algorithm within the framework of…
Expand
1998
1998
A METHOD FOR ANALYSIS OF C-CONTINUITY OF SUBDIVISION SURFACES∗
N. SIAMJ.
1998
Corpus ID: 11393021
A sufficient condition for C1-continuity of subdivision surfaces was proposed by Reif [Comput. Aided Geom. Design, 12 (1995), pp…
Expand
1993
1993
A dynamic algorithm for Gröbner basis computation
M. Caboara
International Symposium on Symbolic and Algebraic…
1993
Corpus ID: 11423192
Grobner bases are fundamental tools for effective computations in polynomial ideel theory; they allow to solve the ideal…
Expand
1992
1992
Multipolynomial resultants and linear algebra
Dinesh Manocha
,
J. Canny
International Symposium on Symbolic and Algebraic…
1992
Corpus ID: 2260933
The problem of eliminating variables from a set of polynomial equations arises in many symbolic and numeric applications. The…
Expand
1991
1991
A Buchberger Algorithm for Distributed Memory Multiprocessors
David J. Hawley
ACPC Conference
1991
Corpus ID: 28602831
Grobner Bases are a mathematical tool that has received considerable attention in recent years. Since the Buchberger Algorithm…
Expand
1990
1990
Very Large Gröbner Basis Calculations
W. Neun
,
H. Melenk
Conférence francophone sur l'apprentissage…
1990
Corpus ID: 37053452
The attempt to solve systems of polynomial equations with Grobner base techniques often leads to large problems which exceed the…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE