Solving a multivariable congruence by change of term order
From MaRDI portal
Publication:1376581
DOI10.1006/jsco.1997.0153zbMath0895.68074OpenAlexW2060182507MaRDI QIDQ1376581
Publication date: 27 September 1998
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/9f41c705d6c666bf3a5d635dbb09bd622c86b498
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (7)
On the ideal associated to a linear code ⋮ Computing syzygies in finite dimension using fast linear algebra ⋮ Some remarks on Fitzpatrick and Flynn's Gröbner basis technique for Padé approximation. ⋮ Gröbner basis approach to list decoding of algebraic geometry codes ⋮ Algebraic structure of quasicyclic codes ⋮ Gröbner bases and combinatorics for binary codes ⋮ Fast computation of Gröbner basis of homogeneous ideals of \(\mathbb{F}[x, y\)]
This page was built for publication: Solving a multivariable congruence by change of term order
