Some comments on the modular approach to Gröbner-bases
From MaRDI portal
Publication:3043268
DOI10.1145/1089330.1089336zbMath0527.13001OpenAlexW2050941404MaRDI QIDQ3043268
Publication date: 1983
Published in: ACM SIGSAM Bulletin (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1089330.1089336
Software, source code, etc. for problems pertaining to commutative algebra (13-04) Ideals and multiplicative ideal theory in commutative rings (13A15)
Related Items (9)
Some examples for solving systems of algebraic equations by calculating Gröbner bases ⋮ A p-adic approach to the computation of Gröbner bases ⋮ Modular techniques for noncommutative Gröbner bases ⋮ p-adic algorithm for bivariate Gröbner bases ⋮ Modular algorithms for computing Gröbner bases. ⋮ Parallelization of modular algorithms ⋮ An approach to solving systems of polynomials via modular arithmetics with applications ⋮ On lucky ideals for Gröbner basis computations ⋮ A Variant of the F4 Algorithm
This page was built for publication: Some comments on the modular approach to Gröbner-bases
