scientific article

Publication date: 1983

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Gaussian elimination systems of algebraic equations Gröbner base

Analysis of algorithms and problem complexity (68Q25) Numerical computation of solutions to systems of equations (65H10) Software, source code, etc. for problems pertaining to commutative algebra (13-04) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Equations in general fields (12E12) Ideals and multiplicative ideal theory in commutative rings (13A15) Relevant commutative algebra (14A05)

Related Items

Semi-Regular Sequences and Other Random Systems of Equations, A new framework for computing Gröbner bases, Unnamed Item, Toric eigenvalue methods for solving sparse polynomial systems, Refined F5 Algorithms for Ideals of Minors of Square Matrices, An estimator for the hardness of the MQ problem, Breaking rainbow takes a weekend on a laptop, A Bridge between Euclid and Buchberger: (An Attempt to Enhance Gröbner Basis Algorithm by PRSs and GCDs), Worst-case subexponential attacks on PRGs of constant degree or constant locality, On the complexity of solving generic overdetermined bilinear systems, Multidimensional realisation theory and polynomial system solving, Matrix-F5 algorithms over finite-precision complete discrete valuation fields, Secure PRNGs from Specialized Polynomial Maps over Any $\mathbb{F}_{q}$, Efficient computation of Castelnuovo-Mumford regularity, Normal Form Analysis of ℤ2-Equivariant Singularities, On the construction of staggered linear bases, An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals, and applications to commutative semigroups, The analytic standard fan of a $\mathcal D$-module, On the Number of Linearly Independent Equations Generated by XL, A Variant of the F4 Algorithm, Relative Gröbner–Shirshov bases for algebras and groups, Computing H-bases via minimal bases for syzygy modules, Unnamed Item, Need Polynomial Systems Be Doubly-Exponential?, A Study on Gröbner Basis with Inexact Input, Computing Gröbner Bases within Linear Algebra, Alternative algorithms for computing generic μ∗-sequences and local Euler obstructions of isolated hypersurface singularities, A Note on Dynamic Gröbner Bases Computation, Breaking an Identity-Based Encryption Scheme Based on DHIES, An algorithmic approach to Chevalley’s Theorem on images of rational morphisms between affine varieties, An improvement of the rational representation for high-dimensional systems, Quantum algorithm for Boolean equation solving and quantum algebraic attack on cryptosystems, Stronger bounds on the cost of computing Gröbner bases for HFE systems, A solution to Kronecker's problem, Gröbner bases of ideals defined by functionals with an application to ideals of projective points, Polly cracker, revisited, MaxMinMax problem and sparse equations over finite fields, First order perturbation and local stability of parametrized systems, New constructive methods in classical ideal theory, Matrix-F5 algorithms and tropical Gröbner bases computation, The tangent cone algorithm and homogenization, Computer algebra: Past and future, An algorithm of computing $b$-functions, On implementing the symbolic preprocessing function over Boolean polynomial rings in Gröbner basis algorithms using linear algebra, History and basic features of the critical-pair/completion procedure, Algorithms for the $b$-function and $D$-modules associated with a polynomial, Solving systems of algebraic equations by a general elimination method, Computing comprehensive Gröbner systems: a comparison of two methods, Solving degree, last fall degree, and related invariants, Encoding algebraic power series, Stability of Gröbner bases, Representing and solving finite-domain constraint problems using systems of polynomials, The Gröbner fan of an ideal, On the complexity exponent of polynomial system solving, A new proof for the correctness of the F5 algorithm, Standard bases and geometric invariant theory. I: Initial ideals and state polytopes, A factorization algorithm for $G$-algebras and its applications, Extended $F_5$ criteria, F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases, Advances and improvements in the theory of standard bases and syzygies, Invariant $\mathrm G^2\mathrm V$ algorithm for computing SAGBI-Gröbner bases, On the complexity of the generalized MinRank problem, Effective power series computations, On the last fall degree of zero-dimensional Weil descent systems, Normal forms of planar polynomial differential systems, Algebraic invariants and local stability of planar differential systems, Characteristic set algorithms for equation solving in finite fields, On the relation between the MXL family of algorithms and Gröbner basis algorithms, CAD and topology of semi-algebraic sets, On the topology of real algebraic plane curves, Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree $(1,1)$: algorithms and complexity, Computing syzygies by Faugère's $\mathbb{F}_{5}$ algorithm, Elliptic curve discrete logarithm problem over small degree extension fields, Probabilistic analysis on Macaulay matrices over finite fields and complexity of constructing Gröbner bases, Gröbner bases and invariant theory, Applying IsRewritten criterion on Buchberger algorithm, Combinatorial dimension theory of algebraic varieties, Involutive bases algorithm incorporating F$_5$ criterion, On the computation of generalized standard bases, GVW algorithm over principal ideal domains, Sparse FGLM algorithms, A survey on signature-based algorithms for computing Gröbner bases, Generalization of the F5 algorithm for calculating Gröbner bases for polynomial ideals, A subresultant-like theory for Buchberger's procedure, Recent improvements in the complexity of the effective Nullstellensatz, Speeding up the GVW algorithm via a substituting method, Separating linear forms and rational univariate representations of bivariate systems, Tangent cone algorithm for homogenized differential operators, Equations for the projective closure and effective Nullstellensatz, La queste del Saint $\text{Gr}_ a(\text{AL})$: A computational approach to local algebra, Using symmetries in the index calculus for elliptic curves discrete logarithm, On the termination of the general XL algorithm and ordinary multinomials, Solving multivariate polynomial systems and an invariant from commutative algebra, A note on upper bounds for ideal-theoretic problems, Parametric FGLM algorithm, Algebraic local cohomology with parameters and parametric standard bases for zero-dimensional ideals, Nonlinear reduction for solving deficient polynomial systems by continuation methods, Computing tropical points and tropical links, On the derivation and reduction of $C^ 1$ trigonometric basis functions using Maple$^{TM}$, Solutions of systems of algebraic equations and linear maps on residue class rings, An algorithm for computing the Hilbert-Samuel multiplicities and reductions of zero-dimensional ideals of Cohen-Macaulay local rings, An improvement over the GVW algorithm for inhomogeneous polynomial systems, Improved agreeing-gluing algorithm, On the use of Buchberger criteria in $\mathrm G^2\mathrm V$ algorithm for calculating Gröbner bases, The F5 criterion revised, Complexity bounds on Semaev's naive index calculus method for ECDLP, A dynamic F4 algorithm to compute Gröbner bases, A dimension series for multivariate splines, On the Jacobian conjecture: A new approach via Gröbner bases, Syzygies among reduction operators, Solving non-linear Boolean equation systems by variable elimination, Dimension and depth dependent upper bounds in polynomial ideal theory, Cryptanalysis of the extension field cancellation cryptosystem, Degree upper bounds for involutive bases, An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography, Thirty years of polynomial system solving, and now?, Solving polynomial systems via symbolic-numeric reduction to geometric involutive form, An involutive GVW algorithm and the computation of Pommaret bases, Degree bounds for Gröbner bases in algebras of solvable type, An algebraic attack on rank metric code-based cryptosystems, Ideal basis and primary decompositions: case of two variables, Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one, Computation of Macaulay constants and degree bounds for Gröbner bases, A combinatorial approach to involution and $\delta $-regularity. I: Involutive bases in polynomial algebras of solvable type, Rayleigh quotient methods for estimating common roots of noisy univariate polynomials, A new efficient algorithm for computing Gröbner bases $(F_4)$, On the complexity of the $F_5$ Gröbner basis algorithm, The virtues of laziness: Complexity of the tangent cone algorithm, Involutive bases in the Weyl algebra., Uniqueness of limit cycles for sewing planar piecewise linear systems