On lucky primes
From MaRDI portal
Publication:1260761
DOI10.1006/jsco.1993.1014zbMath0787.13016OpenAlexW1991925681MaRDI QIDQ1260761
Publication date: 25 August 1993
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/6efaf1452a74aa7507fea6d782f5c01e71346229
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Syzygies, resolutions, complexes and commutative rings (13D02)
Related Items (max. 100)
Modular algorithms for computing Gröbner bases. ⋮ Parallelization of modular algorithms ⋮ An approach to solving systems of polynomials via modular arithmetics with applications ⋮ Matrix-F5 algorithms over finite-precision complete discrete valuation fields ⋮ Gröbner bases for families of affine or projective schemes ⋮ Usage of modular techniques for efficient computation of ideal operations ⋮ Degree reduction under specialization ⋮ A modular method to compute the rational univariate representation of zero-dimensional ideals ⋮ A new algorithm for discussing Gröbner bases with parameters.
This page was built for publication: On lucky primes
