scientific article

Publication date: 1989

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Gröbner basis computation Buchberger-Trinks algorithm

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

Related Items

Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients, A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers, Algorithms to compute the topology of orientable real algebraic surfaces, Complexity results for triangular sets, Gröbner bases of ideals defined by functionals with an application to ideals of projective points, Gröbner bases and critical values: the asymptotic combinatorics of determinantal systems, Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences, Rational Points and Trace Forms on a Finite Algebra over a Real Closed Field, Lower bounds for diophantine approximations, Regular representations of finite-dimensional separable semisimple algebras and Gröbner bases, Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs, Gröbner bases techniques for an \(S\)-packing \(k\)-coloring of a graph, Polynomial equation solving by lifting procedures for ramified fibers, Modular composition modulo triangular sets and applications, Computation of real radicals of polynomial ideals. II, Real root finding for low rank linear matrices, Subresultants and the Shape Lemma, Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization, An FGLM-like algorithm for computing the radical of a zero-dimensional ideal, Root isolation of zero-dimensional polynomial systems with linear univariate representation, Matrix-F5 algorithms over finite-precision complete discrete valuation fields, On the computation of matrices of traces and radicals of ideals, Relaxed Hensel lifting of triangular sets, Some constructions for real algebraic curves, Solving determinantal systems using homotopy techniques, Determinantal formulae for the solution set of zero-dimensional ideals, Deformation techniques for efficient polynomial equation solving., A note on upper bounds for ideal-theoretic problems, Homotopy techniques for solving sparse column support determinantal polynomial systems, An algorithm for solving parametric linear systems, Comprehensive Gröbner bases, Deterministic normal position transformation and its applications, A Gröbner free alternative for polynomial system solving, Block-Krylov techniques in the context of sparse-FGLM algorithms, Evaluation properties of invariant polynomials, A modular method to compute the rational univariate representation of zero-dimensional ideals, A commutative algebra approach to linear codes, Noetherian operators and primary decomposition, Guessing Gröbner bases of structured ideals of relations of sequences, An algorithm for computing Grothendieck local residues. I: Shape basis case, Fast computation of a rational point of a variety over a finite field, Computing Gröbner bases by FGLM techniques in a non-commutative setting, Bit complexity for computing one point in each connected component of a smooth real algebraic set, Computing critical points for invariant algebraic systems, Degröbnerization: a political manifesto, A new algorithm for discussing Gröbner bases with parameters., The calculation of radical ideals in positive characteristic, Solving parametric systems of polynomial equations over the reals through Hermite matrices