scientific article; zbMATH DE number 1273640
From MaRDI portal
Publication:4237370
zbMath0933.68161MaRDI QIDQ4237370
Alessandro Giovini, Carlo Traverso, Gianfranco Niesi, Lorenzo Robbiano, Ferdinando Mora
Publication date: 20 March 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items
An introduction to commutative and noncommutative Gröbner bases, Buchberger-Weispfenning theory for effective associative rings, The F5 algorithm in Buchberger's style, On the correctness of a distributed memory Gröbner basis algorithm, On an implementation of standard bases and syzygies in SINGULAR, Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm, A new proof for the correctness of the F5 algorithm, Gröbner bases for polynomial systems with parameters, Explainable AI insights for symbolic computation: a case study on selecting the variable ordering for cylindrical algebraic decomposition, \textsc{Rings}: an efficient Java/Scala library for polynomial rings, A new algorithm for computing staggered linear bases, Minimal involutive bases, On affine tropical F5 algorithms, Computing inhomogeneous Gröbner bases, Applying IsRewritten criterion on Buchberger algorithm, An analysis of inhomogeneous signature-based Gröbner basis computations, Slimgb: Gröbner bases with slim polynomials, On selection of nonmultiplicative prolongations in computation of Janet bases, Detecting unnecessary reductions in an involutive basis computation, Parallel algorithms for Gröbner-basis construction, Extended parallelism in the Gröbner basis algorithm, A comparison of unrestricted dynamic Gröbner basis algorithms, Parallel computation of Janet and Gröbner bases over rational numbers, Involutive divisions: Slice and pair properties, Thirty years of polynomial system solving, and now?, Reducing the size and number of linear programs in a dynamic Gröbner basis algorithm, New developments in the theory of Gröbner bases and applications to formal verification, Computing Gröbner Bases within Linear Algebra, A Note on Dynamic Gröbner Bases Computation, Polybori: A framework for Gröbner-basis computations with Boolean polynomials, Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures, A new efficient algorithm for computing Gröbner bases \((F_4)\)
Uses Software
