Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal

Authors:
Bruno Buchberger
Affiliations:
Johannes Kepler University of Linz (JKU), RISC Institute, Schloss Hagenberg, 4232 Hagenberg, Austria
Venue:
Journal of Symbolic Computation
Year:
2006

Citing 0
Cited 44

Gröbner bases in difference-differential modules

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Graphs of relations and Hilbert series

Journal of Symbolic Computation
Computation of bases of free modules over the Weyl algebras

Journal of Symbolic Computation
Gröbner bases and the number of Latin squares related to autotopisms of order ≤7

Journal of Symbolic Computation
Solving and factoring boundary problems for linear ordinary differential equations in differential algebras

Journal of Symbolic Computation
Integro-differential polynomials and operators

Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Aligator: A Mathematica Package for Invariant Generation (System Description)

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Valigator: A Verification Tool with Bound and Invariant Generation

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
General polynomial reduction with TH 9 OREM 8 functors: applications to integro-differential operators and polynomials

ACM Communications in Computer Algebra
Noether normalization guided by monomial cone decompositions

Journal of Symbolic Computation
Letterplace ideals and non-commutative Gröbner bases

Journal of Symbolic Computation
Interactions between computer algebra (Gröbner bases) and cryptology

Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Solving Structured Polynomial Systems and Applications to Cryptology

CASC '09 Proceedings of the 11th International Workshop on Computer Algebra in Scientific Computing
A Symbolic Framework for Operations on Linear Boundary Problems

CASC '09 Proceedings of the 11th International Workshop on Computer Algebra in Scientific Computing
A Groebner bases-based approach to backward reasoning in rule based expert systems

Annals of Mathematics and Artificial Intelligence
Invariant generation for P-solvable loops with assignments

CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases

Journal of Symbolic Computation
MXL3: an efficient algorithm for computing gröbner bases of zero-dimensional ideals

ICISC'09 Proceedings of the 12th international conference on Information security and cryptology
An automated confluence proof for an infinite rewrite system parametrized over an integro-differential algebra

ICMS'10 Proceedings of the Third international congress conference on Mathematical software
Aligators for arrays

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree (1,1): Algorithms and complexity

Journal of Symbolic Computation
Computing inhomogeneous Gröbner bases

Journal of Symbolic Computation
Foreword: Bruno Buchberger and the world of Gröbner bases

Journal of Symbolic Computation
Signature-based algorithms to compute Gröbner bases

Proceedings of the 36th international symposium on Symbolic and algebraic computation
Space-efficient Gröbner basis computation without degree bounds

Proceedings of the 36th international symposium on Symbolic and algebraic computation
Macaulay inverse systems revisited

Journal of Symbolic Computation
Proof certificates for algebra and their application to automatic geometry theorem proving

ADG'08 Proceedings of the 7th international conference on Automated deduction in geometry
All mutually unbiased bases in dimensions two to five

Quantum Information & Computation
Gröbner bases and generalized sylvester matrices

ACM Communications in Computer Algebra
Some combinatorial applications of Gröbner bases

CAI'11 Proceedings of the 4th international conference on Algebraic informatics
A logic approach to decision taking in a railway interlocking system using Maple

Mathematics and Computers in Simulation
A new algebraic model for implementing expert systems represented under the 'Concept-Attribute-Value' paradigm

Mathematics and Computers in Simulation
Invariant and type inference for matrices

VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Transforming problems from analysis to algebra: A case study in linear boundary problems

Journal of Symbolic Computation
A complete invariant generation approach for p-solvable loops

PSI'09 Proceedings of the 7th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics
On the relation between the MXL family of algorithms and Gröbner basis algorithms

Journal of Symbolic Computation
Complexity of Gröbner basis detection and border basis detection

Theoretical Computer Science
ElimLin algorithm revisited

FSE'12 Proceedings of the 19th international conference on Fast Software Encryption
A logic-algebraic approach to decision taking in a railway interlocking system

Annals of Mathematics and Artificial Intelligence
Solving polynomial systems over finite fields: improved analysis of the hybrid approach

Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Gröbner bases of ideals invariant under a commutative group: the non-modular case

Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Representing and solving finite-domain constraint problems using systems of polynomials

Annals of Mathematics and Artificial Intelligence
First-Order theorem proving and vampire

CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Grade Filtration of Linear Functional Systems

Acta Applicandae Mathematicae: an international survey journal on applying mathematics and mathematical applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This is the English translation (by Michael P. Abramson) of the PhD thesis of Bruno Buchberger, in which he introduced the algorithmic theory of Grobner bases. Some comments by Buchberger on the translation and the thesis are given in an additional short paper in this issue of the Journal of Symbolic Computation.