About: Buchberger's algorithm

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Buchberger's algorithm Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

In computational algebraic geometry and computational commutative algebra, Buchberger's algorithm is a method of transforming a given set of generators for a polynomial ideal into a Gröbner basis with respect to some monomial order. It was invented by Austrian mathematician Bruno Buchberger. One can view it as a generalization of the Euclidean algorithm for univariate GCD computation and of Gaussian elimination for linear systems.

Attributes	Values
rdfs:label	Buchberger's algorithm (en)
rdfs:comment	In computational algebraic geometry and computational commutative algebra, Buchberger's algorithm is a method of transforming a given set of generators for a polynomial ideal into a Gröbner basis with respect to some monomial order. It was invented by Austrian mathematician Bruno Buchberger. One can view it as a generalization of the Euclidean algorithm for univariate GCD computation and of Gaussian elimination for linear systems. (en)
sameAs	Buchberger's algorithm Buchberger's algorithm
dbp:wikiPageUsesTemplate	dbt:Cite_journal dbt:ISBN dbt:Math dbt:MathWorld dbt:Reflist dbt:Springer
Subject	Algebraic geometry Commutative algebra Computer algebra Rewriting systems
Link from a Wikipage to an external page	http://www.scholarpedia.org/article/Buchberger%27s_algorithm
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Buchberger's_algorithm?oldid=1042807134&ns=0
Wikipage page ID	696317 (xsd:integer)
page length (characters) of wiki page	5895 (xsd:nonNegativeInteger)
Wikipage revision ID	1042807134 (xsd:integer)
Link from a Wikipage to another Wikipage	Greatest common divisor Algebraic geometry Monomial order Bruno Buchberger Algebraic geometry Commutative algebra Computer algebra Rewriting systems Dickson's lemma Critical pair (term rewriting) Degree of a polynomial Linear algebra Linear relation Linear system Time complexity Commutative algebra Hilbert's basis theorem Gaussian elimination Ideal (ring theory) Faugère's F4 and F5 algorithms Gröbner basis Vector space Euclidean algorithm Knuth–Bendix completion algorithm Least common multiple Mathematician Quine–McCluskey algorithm
has abstract	In computational algebraic geometry and computational commutative algebra, Buchberger's algorithm is a method of transforming a given set of generators for a polynomial ideal into a Gröbner basis with respect to some monomial order. It was invented by Austrian mathematician Bruno Buchberger. One can view it as a generalization of the Euclidean algorithm for univariate GCD computation and of Gaussian elimination for linear systems. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Buchberger's_algorithm
is Wikipage redirect of	Buchberger's Algorithm Buchberger algorithm
is Link from a Wikipage to another Wikipage of	Bergman's diamond lemma Bruno Buchberger Buchberger Buchberger's Algorithm Criss-cross algorithm Critical pair Computer algebra system Cubic function List of algorithms List of commutative algebra topics Elimination theory Gaussian elimination Buchberger algorithm Faugère's F4 and F5 algorithms Gröbner basis Klee–Minty cube Knuth–Bendix completion algorithm
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Buchberger's_algorithm

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (71 GB total memory, 2 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software