scientific article; zbMATH DE number 3649988

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

Cited in

(only showing first 100 items - show all)

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

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)