scientific article; zbMATH DE number 3649988
From MaRDI portal
Publication:3208084
Cited in
(only showing first 100 items - show all)- msolve. A library for solving polynomial systems
- On two signature variants of Buchberger's algorithm over principal ideal domains
- Extended \(F_5\) criteria
- Consider only general superpositions in completion procedures
- On the use of Buchberger criteria in \(\mathrm G^2\mathrm V\) algorithm for calculating Gröbner bases
- A general framework for Noetherian well ordered polynomial reductions
- On the construction of staggered linear bases
- Applying IsRewritten criterion on Buchberger algorithm
- Buchberger-Zacharias theory of multivariate Ore extensions
- Algorithms for solving reachability problems in 2-link planar arms using Gröbner bases
- A Variant of the F4 Algorithm
- A p-adic approach to the computation of Gröbner bases
- GVW algorithm over principal ideal domains
- The first syzygies of determinantal ideals
- Effective Buchberger-Zacharias-Weispfenning theory of skew polynomial extensions of subbilateral coherent rings
- De nugis Groebnerialium 6: Rump, Ufnarovski, Zacharias
- 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
- Speeding up the GVW algorithm via a substituting method
- 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
- Normal form analysis of \(\mathbb Z_2\)-equivariant singularities
- Computational algebraic geometry of projective configurations
- A new framework for computing Gröbner bases
- The membrane inclusions curvature equations
- A parametric \(\mathrm{F}_4\) algorithm
- A combined method for enclosing all solutions of nonlinear systems of polynomial equations
- Some improvements for the algorithm of Gröbner bases over dual valuation domain
- Extended parallelism in the Gröbner basis algorithm
- Gröbner systems conversion
- Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm
- An improvement for GVW
- On the decoding of binary cyclic codes with the Newton identities
- Gröbner bases over fields with valuations
- Gröbner-Shirshov basis for the braid group in the Birman-Ko-Lee generators.
- 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
- A new efficient algorithm for computing Gröbner bases (F₄)
- A survey on signature-based algorithms for computing Gröbner bases
- Involutive bases of polynomial ideals
- Minimal involutive 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
- Computing coupled border bases
- 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
- 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
- Computing comprehensive Gröbner systems: a comparison of two methods
- A non-commutative \(F_5\) algorithm with an application to the computation of Loewy layers.
- 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
- Improvement of an incremental signature-based comprehensive Gröbner system algorithm
- A new algorithm for computing staggered linear bases
- Sufficient set of integrability conditions of an orthonomic system
- Relative Gröbner and involutive bases for ideals in quotient rings
- Dimension and depth dependent upper bounds in polynomial ideal theory
- Signature-based standard basis algorithm under the framework of GVW algorithm
- 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
- 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
- On set-theoretic complete intersections in the projective space
- Automating inductionless induction using test sets
- An improvement over the GVW algorithm for inhomogeneous polynomial systems
- A general class of Danielewski algebras
- Ideal basis and primary decompositions: case of two variables
- Unnecessary inferences in associative-commutative completion procedures
- Interfacing external CA systems for Gröbner bases computation in Mizar proof checking
- Automated short proof generation for projective geometric theorems with Cayley and bracket algebras. I: Incidence geometry.
- An involutive GVW algorithm and the computation of Pommaret bases
- Cryptanalysis of the extension field cancellation cryptosystem
- Computer algebra: Past and future
- A Note on Dynamic Gröbner Bases Computation
- An algorithm for the construction of matrix representations for finitely presented non-commutative algebras
- Decomposing algebraic sets using Gröbner bases
- A computational model for algebraic power series
- A lattice formulation of the noncommutative \(F_4\) procedure
- On noncommutative finite factorization domains
- A new algorithm for Gröbner bases conversion
- Computing representations for radicals of finitely generated differential ideals
- The freeness property for locally nilpotent derivations of \(R^{[2]}\)
- History and basic features of the critical-pair/completion procedure
- On the construction of Gröbner bases using syzygies
- Improved computation of involutive bases
- Detecting unnecessary reductions in an involutive basis computation
- On the Complexity of Linear Algebra Operations over Algebraic Extension Fields
- Computing inhomogeneous Gröbner bases
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)
