Buchberger's algorithm is a method in the theory of multivariate polynomials for transforming a given set of polynomials into a Groebner basis, an equivalent set of polynomials sharing the same common zeros that is more convenient for extracting information about those zeros. It was introduced by Bruno Buchberger at the same time he defined Groebner bases themselves. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Connections
In Field
Source Wikipedia: Buchberger's algorithm
Sources
Wikipedia: Buchberger's algorithm
In Field: Computer Algebra, Lead sentenceQuote, In Field: Computer Algebra, Lead sentence
Buchberger's algorithm is a method for transforming a given set of polynomials into a Gröbner basis, which is another set of polynomials that have the same common zeros and are more convenient for extracting information on these common zeros.
Wikidata: Buchberger's algorithm
Wikidata Q997962, class allow-list match (w-wdresolver-0926)View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.