Notes on Gröbner bases

DOI10.1016/0020-0255(89)90037-6zbMath0686.13005MaRDI QIDQ1262348

K. Appert

Publication date: 1989

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(89)90037-6

zbMATH Keywords

computational algebraic geometry; standard basis; reduced Gröbner bases

Mathematics Subject Classification ID

68W30: Symbolic computation and algebraic computation

13-04: Software, source code, etc. for problems pertaining to commutative algebra

13F20: Polynomial rings and ideals; rings of integer-valued polynomials

14-04: Software, source code, etc. for problems pertaining to algebraic geometry

14A05: Relevant commutative algebra

Related Items

Extended parallelism in the Gröbner basis algorithm, A geometric consistency theorem for a symbolic perturbation scheme, An algorithm for solving parametric linear systems, A solution to Kronecker's problem, Constructing invariants for hybrid systems, Symbolic treatment of geometric degeneracies

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the theory of graded structures
• The complexity of the word problems for commutative semigroups and polynomial ideals
• Comments on the translation of my PhD thesis: ``An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
• Resolution of singularities of an algebraic variety over a field of characteristic zero. I
• A simplified proof of the characterization theorem for Gröbner-bases
• Historical Ramblings in Algebraic Geometry and Related Algebra
• Constructions in Algebra
• On the Length of a Hilbert Ascending Chain
• Constructive Proof of Hilbert's Theorem on Ascending Chains
• Constructive Aspects of Noetherian Rings