Admissible term orderings used in computer algebra systems

From MaRDI portal

Revision as of 15:08, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3816970

Jump to:navigation, search

DOI10.1145/43882.43887zbMath0665.68025OpenAlexW2019072139MaRDI QIDQ3816970

Heinz Kredel

Publication date: 1988

Published in: ACM SIGSAM Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/43882.43887

zbMATH Keywords

Gröbner bases computer algebra term ordering of monomials

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Software, source code, etc. for problems pertaining to commutative algebra (13-04) Polynomial rings and ideals; rings of integer-valued polynomials (13F20)

Related Items (2)

Computing dimension and independent sets for polynomial ideals ⋮ An algorithm for solving parametric linear systems

This page was built for publication: Admissible term orderings used in computer algebra systems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3816970&oldid=17394946"