Publication:3678669
From MaRDI portal
zbMath0564.68030MaRDI QIDQ3678669
Hans-Michael Möller, Ferdinando Mora
Publication date: 1984
Gröbner basis; upper bound; lower bound; multivariate polynomials; Buchberger's algorithm; polynomial ideal; maximal degrees
68Q25: Analysis of algorithms and problem complexity
68W30: Symbolic computation and algebraic computation
Related Items
An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals, and applications to commutative semigroups, Counting and Gröbner bases, On the Jacobian conjecture: A new approach via Gröbner bases, A new lower bound construction for commutative Thue systems with applications, Gröbner bases and invariant theory, Degree bounds for Gröbner bases in algebras of solvable type, New constructive methods in classical ideal theory, History and basic features of the critical-pair/completion procedure, Gröbner bases and Hilbert schemes. I, The Gröbner fan of an ideal, Equations for the projective closure and effective Nullstellensatz, Comprehensive Gröbner bases, Notes on Gröbner bases, Reduction numbers of ideals, Computation of real radicals of polynomial ideals. II, Modular algorithms for computing Gröbner bases., On the Gröbner bases of some symmetric systems and their application to coding theory., Castelnuovo-Mumford regularity of initial ideals, Finiteness of Hilbert functions and bounds for Castelnuovo-Mumford regularity of initial ideals, Asymptotic behaviour of standard bases
