scientific article; zbMATH DE number 3649988

zbMATH Open0417.68029MaRDI QIDQ3208084FDOQ3208084

Publication date: 1979

Title of this publication is not available (Why is that?)

computational complexity commutative rings algorithmic construction polynomial ideals Gröbner-bases

Analysis of algorithms and problem complexity (68Q25) Polynomials over finite fields (11T06) Ideals and multiplicative ideal theory in commutative rings (13A15)

Cited In (only showing first 100 items - show all)

De nugis Groebnerialium 6: Rump, Ufnarovski, Zacharias
Speeding up the GVW algorithm via a substituting method
Normal form analysis of \(\mathbb Z_2\)-equivariant singularities
The membrane inclusions curvature equations
A parametric \(\mathrm{F}_4\) algorithm
Some improvements for the algorithm of Gröbner bases over dual valuation domain
An improvement for GVW
On pot, pans and pudding or how to discover generalised critical pairs
Buchberger's algorithm: The term rewriter's point of view
Automated short proof generation for projective geometric theorems with Cayley and bracket algebras. II: Conic geometry.
Standard bases over Euclidean domains
Polynomial selection of <i>F</i><sub>4</sub> for solving the MQ problem
Buchberger-Weispfenning theory for effective associative rings
Mathematical theory exploration in Theorema: reduction rings
Are Buchberger's criteria necessary for the chain condition?
Toward involutive bases over effective rings
Computing comprehensive Gröbner systems: a comparison of two methods
Improvement of an incremental signature-based comprehensive Gröbner system algorithm
A non-commutative \(F_5\) algorithm with an application to the computation of Loewy layers.
A new algorithm for computing staggered linear bases
Signature-based standard basis algorithm under the framework of GVW algorithm
Relative Gröbner and involutive bases for ideals in quotient rings
Dimension and depth dependent upper bounds in polynomial ideal theory
A general class of Danielewski algebras
An involutive GVW algorithm and the computation of Pommaret bases
A lattice formulation of the noncommutative \(F_4\) procedure
A new algorithm for Gröbner bases conversion
On noncommutative finite factorization domains
The freeness property for locally nilpotent derivations of \(R^{[2]}\)
Improved computation of involutive bases
On the Complexity of Linear Algebra Operations over Algebraic Extension Fields
Tangent complexes and the Diamond Lemma
On the correctness of a distributed memory Gröbner basis algorithm
msolve. A library for solving polynomial systems
On two signature variants of Buchberger's algorithm over principal ideal domains
On the use of Buchberger criteria in \(\mathrm G^2\mathrm V\) algorithm for calculating Gröbner bases
On the construction of staggered linear bases
Algorithms for solving reachability problems in 2-link planar arms using Gröbner bases
Effective Buchberger-Zacharias-Weispfenning theory of skew polynomial extensions of subbilateral coherent rings
On an installation of Buchberger's algorithm
A refutational approach to geometry theorem proving
The F5 algorithm in Buchberger's style
Efficiently computing minimal sets of critical pairs
A new algorithm for computing regular representations for radicals of parametric differential ideals
Invariant \(\mathrm G^2\mathrm V\) algorithm for computing SAGBI-Gröbner bases
A new framework for computing Gröbner bases
Computational algebraic geometry of projective configurations
A combined method for enclosing all solutions of nonlinear systems of polynomial equations
Gröbner systems conversion
Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm
Extended parallelism in the Gröbner basis algorithm
Gröbner bases over fields with valuations
On the decoding of binary cyclic codes with the Newton identities
Gröbner-Shirshov basis for the braid group in the Birman-Ko-Lee generators.
A new efficient algorithm for computing Gröbner bases \((F_4)\)
A survey on signature-based algorithms for computing Gröbner bases
Using Gröbner bases to determine algebra membership, split surjective algebra homomorphisms determine birational equivalence
A new signature-based algorithms for computing Gröbner bases
Involutive bases of polynomial ideals
Minimal involutive bases
Computing coupled border bases
On the walk
Modular algorithms for computing Gröbner bases.
New constructive methods in classical ideal theory
Multi-valued logic and Gröbner bases with applications to modal logic
On superG-bases
Gröbner bases and primary decomposition of polynomial ideals
Gröbner bases of ideals defined by functionals with an application to ideals of projective points
Sufficient set of integrability conditions of an orthonomic system
On the Jacobian conjecture: A new approach via Gröbner bases
Using Gröbner bases to reason about geometry problems
The F5 criterion revised
Certifying properties of an efficient functional program for computing Gröbner bases
On set-theoretic complete intersections in the projective space
A generalization of the Boulier-Buchberger criterion for the computation of characteristic sets of differential ideals
A Pommaret bases approach to the degree of a polynomial ideal
Automating inductionless induction using test sets
An improvement over the GVW algorithm for inhomogeneous polynomial systems
Interfacing external CA systems for Gröbner bases computation in Mizar proof checking
Unnecessary inferences in associative-commutative completion procedures
Ideal basis and primary decompositions: case of two variables
Cryptanalysis of the extension field cancellation cryptosystem
Automated short proof generation for projective geometric theorems with Cayley and bracket algebras. I: Incidence geometry.
Computer algebra: Past and future
A Note on Dynamic Gröbner Bases Computation
Decomposing algebraic sets using Gröbner bases
An algorithm for the construction of matrix representations for finitely presented non-commutative algebras
A computational model for algebraic power series
Computing representations for radicals of finitely generated differential ideals
History and basic features of the critical-pair/completion procedure
On the construction of Gröbner bases using syzygies
Detecting unnecessary reductions in an involutive basis computation
Computing inhomogeneous Gröbner bases
Polybori: A framework for Gröbner-basis computations with Boolean polynomials
Slimgb: Gröbner bases with slim polynomials
Taylor and Lyubeznik resolutions via Gröbner bases.
A new proof for the correctness of the F5 algorithm
Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures
The Computational Complexity of the Resolution of Plane Curve Singularities
Consider only general superpositions in completion procedures

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3208084)