Solving thousand-digit Frobenius problems using Gröbner bases
From MaRDI portal
Publication:2481471
DOI10.1016/j.jsc.2007.06.002zbMath1132.13311OpenAlexW2104550739MaRDI QIDQ2481471
Publication date: 10 April 2008
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2007.06.002
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Computational number theory (11Y99)
Related Items
THE SHORT RESOLUTION OF A SEMIGROUP ALGEBRA, Expected Frobenius numbers, A ``pseudo-polynomial algorithm for the Frobenius number and Gröbner basis, The Frobenius number in the set of numerical semigroups with fixed multiplicity and genus, The Frobenius Problem and Its Generalizations, Cohen-Macaulay criteria for projective monomial curves via Gröbner bases, The slice algorithm for irreducible decomposition of monomial ideals, Frobby
Uses Software
Cites Work