Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
From MaRDI portal
Publication:2457345
DOI10.1016/j.jsc.2005.09.007zbMath1158.01307MaRDI QIDQ2457345
Publication date: 23 October 2007
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2005.09.007
68W30: Symbolic computation and algebraic computation
13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)
01A75: Collected or selected works; reprintings or translations of classics
68-03: History of computer science
Related Items
Minimal polynomial systems for parametric matrices, The Cyclicity of a Cubic System, Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic, Grade filtration of linear functional systems., Transforming problems from analysis to algebra: a case study in linear boundary problems, On the relation between the MXL family of algorithms and Gröbner basis algorithms, A logic approach to decision taking in a railway interlocking system using Maple, A new algebraic model for implementing expert systems represented under the `concept-attribute-value' paradigm, Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity, Cyclotomic Hecke algebras of \(G(r,p,n)\)., Triangularizing kinematic constraint equations using Gröbner bases for real-time dynamic simulation, The F\(_{4}\)-algorithm for Euclidean rings, An approach to solving systems of polynomials via modular arithmetics with applications, A Gröbner-bases algorithm for the computation of the cohomology of Lie (super) algebras, Pivoting in extended rings for computing approximate Gröbner bases, The Logics' Explorer: a Maple package for exploring finite many-valued propositional logics, A logic-algebraic approach to decision taking in a railway interlocking system, An algebraic foundation for factoring linear boundary problems, An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography, Noether normalization guided by monomial cone decompositions, Letterplace ideals and non-commutative Gröbner bases., An algorithm for the construction of matrix representations for finitely presented non-commutative algebras, Standard bases and some computations in rings of power series, Solving and factoring boundary problems for linear ordinary differential equations in differential algebras, Parametrizing compactly supported orthonormal wavelets by discrete moments, Estimating the number of limit cycles in polynomial systems, An algebraic approach to rule based expert systems, A generalization of Castelnuovo-Mumford regularity for representations of noncommutative algebras., A verified common lisp implementation of Buchberger's algorithm in ACL2, Complexity of Gröbner basis detection and border basis detection, A Gröbner bases-based rule based expert system for fibromyalgia diagnosis, Shattering-extremal set systems of small VC-dimension, Macaulay inverse systems revisited, A Groebner bases-based approach to backward reasoning in rule based expert systems, Graphs of relations and Hilbert series., Computation of bases of free modules over the Weyl algebras., Gröbner bases and the number of Latin squares related to autotopisms of order \(\leq 7\), APPLYING BUCHBERGER'S CRITERIA FOR COMPUTING GRÖBNER BASES OVER FINITE-CHAIN RINGS, AN APPLICATION OF REGULAR CHAIN THEORY TO THE STUDY OF LIMIT CYCLES, AN AXIOMATIC SETUP FOR ALGORITHMIC HOMOLOGICAL ALGEBRA AND AN ALTERNATIVE APPROACH TO LOCALIZATION, CONSTRUCTING FULL BLOCK TRIANGULAR REPRESENTATIONS OF ALGEBRAS, homalg – A META-PACKAGE FOR HOMOLOGICAL ALGEBRA, Aligator: A Mathematica Package for Invariant Generation (System Description)
Cites Work
