scientific article
From MaRDI portal
Publication:3208084
zbMath0417.68029MaRDI QIDQ3208084
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Polynomials over finite fields (11T06) Ideals and multiplicative ideal theory in commutative rings (13A15)
Related Items
Some improvements for the algorithm of Gröbner bases over dual valuation domain, The first syzygies of determinantal ideals, Interfacing external CA systems for Gröbner bases computation in M<scp>izar</scp>proof checking, Polynomial selection of <i>F</i><sub>4</sub> for solving the MQ problem, An improvement for GVW, A generalization of the Boulier-Buchberger criterion for the computation of characteristic sets of differential ideals, Gröbner systems conversion, Gröbner bases of ideals defined by functionals with an application to ideals of projective points, New constructive methods in classical ideal theory, Buchberger-Weispfenning theory for effective associative rings, The F5 algorithm in Buchberger's style, A new framework for computing Gröbner bases, Using Gröbner bases to reason about geometry problems, Consider only general superpositions in completion procedures, On the correctness of a distributed memory Gröbner basis algorithm, Buchberger's algorithm: The term rewriter's point of view, Computer algebra: Past and future, A combined method for enclosing all solutions of nonlinear systems of polynomial equations, History and basic features of the critical-pair/completion procedure, Computing comprehensive Gröbner systems: a comparison of two methods, Efficiently computing minimal sets of critical pairs, Only prime superpositions need be considered in the Knuth-Bendix completion procedure, Critical pair criteria for completion, A Pommaret bases approach to the degree of a polynomial ideal, On set-theoretic complete intersections in the projective space, Sufficient set of integrability conditions of an orthonomic system, Gröbner bases and primary decomposition of polynomial ideals, A p-adic approach to the computation of Gröbner bases, 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, On an installation of Buchberger's algorithm, A refutational approach to geometry theorem proving, Extended \(F_5\) criteria, Invariant \(\mathrm G^2\mathrm V\) algorithm for computing SAGBI-Gröbner bases, Unnecessary inferences in associative-commutative completion procedures, Computing coupled border bases, On the walk, On noncommutative finite factorization domains, Modular algorithms for computing Gröbner bases., A new algorithm for computing staggered linear bases, Involutive bases of polynomial ideals, Minimal involutive bases, The freeness property for locally nilpotent derivations of \(R^{[2}\)], Standard bases over Euclidean domains, Computing inhomogeneous Gröbner bases, On the construction of Gröbner bases using syzygies, Applying IsRewritten criterion on Buchberger algorithm, Involutive bases algorithm incorporating F\(_5\) criterion, An algorithm for the construction of matrix representations for finitely presented non-commutative algebras, GVW algorithm over principal ideal domains, A survey on signature-based algorithms for computing Gröbner bases, Slimgb: Gröbner bases with slim polynomials, 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., A non-commutative \(F_5\) algorithm with an application to the computation of Loewy layers., On superG-bases, A lattice formulation of the noncommutative F4 procedure, Computational algebraic geometry of projective configurations, Normal Form Analysis of ℤ2-Equivariant Singularities, Speeding up the GVW algorithm via a substituting method, Detecting unnecessary reductions in an involutive basis computation, A computational model for algebraic power series, Are Buchberger's criteria necessary for the chain condition?, On the construction of staggered linear bases, Parametric FGLM algorithm, Algorithms for solving reachability problems in 2-link planar arms using Gröbner bases, Extended parallelism in the Gröbner basis algorithm, A general framework for Noetherian well ordered polynomial reductions, An improvement over the GVW algorithm for inhomogeneous polynomial systems, The membrane inclusions curvature equations, 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, The F5 criterion revised, Gröbner bases over fields with valuations, Toward involutive bases over effective rings, A new algorithm for computing regular representations for radicals of parametric differential ideals, On the Jacobian conjecture: A new approach via Gröbner bases, Dimension and depth dependent upper bounds in polynomial ideal theory, Effective Buchberger-Zacharias-Weispfenning theory of skew polynomial extensions of subbilateral coherent rings, Cryptanalysis of the extension field cancellation cryptosystem, The Computational Complexity of the Resolution of Plane Curve Singularities, On the decoding of binary cyclic codes with the Newton identities, A Variant of the F4 Algorithm, On pot, pans and pudding or how to discover generalised critical Pairs, 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., 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, Computing representations for radicals of finitely generated differential ideals, Mathematical Theory Exploration in Theorema: Reduction Rings, Automating inductionless induction using test sets, Ideal basis and primary decompositions: case of two variables, Improved Computation of Involutive Bases, A Note on Dynamic Gröbner Bases Computation, Polybori: A framework for Gröbner-basis computations with Boolean polynomials, Decomposing algebraic sets using Gröbner bases, Using Gröbner bases to determine algebra membership, split surjective algebra homomorphisms determine birational equivalence, 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)\), A new signature-based algorithms for computing Gröbner bases, De nugis Groebnerialium 6: Rump, Ufnarovski, Zacharias, Multi-valued logic and Gröbner bases with applications to modal logic, Taylor and Lyubeznik resolutions via Gröbner bases.
