グレブナー基底
1. Gröbner basisIn computer algebra, computational algebraic geometry, and computational commutative algebra, a Gröbner basis is a particular kind of generating subset of an ideal I in a polynomial ring R. One can view it as a multivariate, non-linear generalization of: the Euclidean algorithm for computation of univariate greatest common divisors, Gaussian elimination for linear systems, and integer programming problems.
Read “Gröbner basis” on English Wikipedia
Read “グレブナー基底” on Japanese Wikipedia
Read “Gröbner basis” on DBpedia
Read “Gröbner basis” on English Wikipedia
Read “グレブナー基底” on Japanese Wikipedia
Read “Gröbner basis” on DBpedia
Discussions
Log in to talk about this word.