scientific article; zbMATH DE number 3857249

zbMATH Open0539.13002MaRDI QIDQ3325833FDOQ3325833

Authors: D. Lazard 

Publication date: 1983

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

Recommendations

• Gröbner bases and systems of algebraic equations
• Solving systems of algebraic equations by using Gröbner bases
• scientific article; zbMATH DE number 4132308
• scientific article; zbMATH DE number 1273652
• Gröbner bases and solving nonlinear polynomial systems
• Gröbner bases for problem solving in multidimensional systems
• Gröbner bases and involutive methods for algebraic and differential equations
• Construction of Gröbner bases for investigation of systems of polynomial equations
• Solving linear systems of equations over integers with Gröbner bases

zbMATH Keywords

Gaussian eliminationsystems of algebraic equationsGröbner base

Mathematics Subject Classification ID

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

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

• Gröbner bases and invariant theory
• Some examples for solving systems of algebraic equations by calculating Gröbner bases
• Standard bases and geometric invariant theory. I: Initial ideals and state polytopes
• Invariant \(\mathrm G^2\mathrm V\) algorithm for computing SAGBI-Gröbner bases
• Title not available (Why is that?)
• Solving systems of algebraic equations by a general elimination method
• Sparse FGLM algorithms
• A new framework for computing Gröbner bases
• An algorithm of computing \(b\)-functions
• Combinatorial dimension theory of algebraic varieties
• Characteristic set algorithms for equation solving in finite fields
• A dimension series for multivariate splines
• MaxMinMax problem and sparse equations over finite fields
• Polly cracker, revisited
• Uniqueness of limit cycles for sewing planar piecewise linear systems
• Stability of Gröbner bases
• An algebraic attack on rank metric code-based cryptosystems
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• A survey on signature-based algorithms for computing Gröbner bases
• Generalization of the F5 algorithm for calculating Gröbner bases for polynomial ideals
• Title not available (Why is that?)
• F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases
• First order perturbation and local stability of parametrized systems
• Effective power series computations
• Computing Gröbner Bases within Linear Algebra
• On the complexity exponent of polynomial system solving
• On the last fall degree of zero-dimensional Weil descent systems
• New constructive methods in classical ideal theory
• On the relation between the MXL family of algorithms and Gröbner basis algorithms
• Gröbner bases of ideals defined by functionals with an application to ideals of projective points
• Solving degree, last fall degree, and related invariants
• Refined F5 Algorithms for Ideals of Minors of Square Matrices
• On the Jacobian conjecture: A new approach via Gröbner bases
• The F5 criterion revised
• Separating linear forms and rational univariate representations of bivariate systems
• An improvement over the GVW algorithm for inhomogeneous polynomial systems
• Ideal basis and primary decompositions: case of two variables
• On the complexity of the \(F_5\) Gröbner basis algorithm
• Computing syzygies by Faugère's \(\mathbb{F}_{5}\) algorithm
• CAD and topology of semi-algebraic sets
• Normal forms of planar polynomial differential systems
• Computer algebra: Past and future
• A dynamic F4 algorithm to compute Gröbner bases
• A Note on Dynamic Gröbner Bases Computation
• Improved agreeing-gluing algorithm
• On the complexity of the generalized MinRank problem
• The \(d\)-step conjecture and Gaussian elimination
• Using symmetries in the index calculus for elliptic curves discrete logarithm
• Degree bounds for Gröbner bases in algebras of solvable type
• La queste del Saint \(\text{Gr}_ a(\text{AL})\): A computational approach to local algebra
• Solving polynomial systems via symbolic-numeric reduction to geometric involutive form
• The tangent cone algorithm and homogenization
• A combinatorial approach to involution and \(\delta \)-regularity. I: Involutive bases in polynomial algebras of solvable type
• The Gröbner fan of an ideal
• On implementing the symbolic preprocessing function over Boolean polynomial rings in Gröbner basis algorithms using linear algebra
• On the topology of real algebraic plane curves
• Representing and solving finite-domain constraint problems using systems of polynomials
• Tangent cone algorithm for homogenized differential operators
• Solutions of systems of algebraic equations and linear maps on residue class rings
• Thirty years of polynomial system solving, and now?
• An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography
• A new proof for the correctness of the F5 algorithm
• Advances and improvements in the theory of standard bases and syzygies
• Involutive bases algorithm incorporating F\(_5\) criterion
• Algebraic local cohomology with parameters and parametric standard bases for zero-dimensional ideals
• Parametric FGLM algorithm
• Extended \(F_5\) criteria
• Algorithms for the \(b\)-function and \(D\)-modules associated with a polynomial
• Solving non-linear Boolean equation systems by variable elimination
• Applying IsRewritten criterion on Buchberger algorithm
• A Variant of the F4 Algorithm
• Properties of Gröbner bases under specializations
• Equations for the projective closure and effective Nullstellensatz
• A note on upper bounds for ideal-theoretic problems
• Elliptic curve discrete logarithm problem over small degree extension fields
• Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity
• GVW algorithm over principal ideal domains
• Breaking an identity-based encryption scheme based on DHIES
• Worst-case subexponential attacks on PRGs of constant degree or constant locality
• Rayleigh quotient methods for estimating common roots of noisy univariate polynomials
• Computing tropical points and tropical links
• Toric eigenvalue methods for solving sparse polynomial systems
• Speeding up the GVW algorithm via a substituting method
• Normal form analysis of \(\mathbb Z_2\)-equivariant singularities
• Relative Gröbner-Shirshov bases for algebras and groups.
• Title not available (Why is that?)
• Stronger bounds on the cost of computing Gröbner bases for HFE systems
• A parametric \(\mathrm{F}_4\) algorithm
• An algorithm for computing the Hilbert-Samuel multiplicities and reductions of zero-dimensional ideals of Cohen-Macaulay local rings
• On the termination of the general XL algorithm and ordinary multinomials
• Need polynomial systems be doubly-exponential?
• Quantum algorithm for Boolean equation solving and quantum algebraic attack on cryptosystems
• Semi-regular sequences and other random systems of equations
• A subresultant-like theory for Buchberger's procedure
• Complexity bounds on Semaev's naive index calculus method for ECDLP
• Solving multivariate polynomial systems and an invariant from commutative algebra
• On the complexity of solving generic overdetermined bilinear systems
• The analytic standard fan of a \(\mathcal D\)-module
• Algebraic approaches for the design of simultaneous observers for linear systems
• Multidimensional realisation theory and polynomial system solving

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 Q3325833)