scientific article; zbMATH DE number 3857249

Publication date 1983

Gaussian elimination systems of algebraic equations Gröbner base

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)

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

Cited in

(only showing first 100 items - show all)

GVW algorithm over principal ideal domains
Gröbner bases and invariant theory
Some examples for solving systems of algebraic equations by calculating Gröbner bases
Breaking an identity-based encryption scheme based on DHIES
Standard bases and geometric invariant theory. I: Initial ideals and state polytopes
Rayleigh quotient methods for estimating common roots of noisy univariate polynomials
Computing tropical points and tropical links
Worst-case subexponential attacks on PRGs of constant degree or constant locality
Speeding up the GVW algorithm via a substituting method
Invariant $\mathrm G^2\mathrm V$ algorithm for computing SAGBI-Gröbner bases
Sparse FGLM algorithms
Solving systems of algebraic equations by a general elimination method
Toric eigenvalue methods for solving sparse polynomial systems
Normal form analysis of $\mathbb Z_2$-equivariant singularities
Relative Gröbner-Shirshov bases for algebras and groups.
Stronger bounds on the cost of computing Gröbner bases for HFE systems
scientific article; zbMATH DE number 1254248 (Why is no real title available?)
A new framework for computing Gröbner bases
scientific article; zbMATH DE number 4045008 (Why is no real title available?)
An algorithm for computing the Hilbert-Samuel multiplicities and reductions of zero-dimensional ideals of Cohen-Macaulay local rings
Characteristic set algorithms for equation solving in finite fields
An algorithm of computing $b$-functions
Combinatorial dimension theory of algebraic varieties
A parametric $\mathrm{F}_4$ algorithm
On the termination of the general XL algorithm and ordinary multinomials
A dimension series for multivariate splines
MaxMinMax problem and sparse equations over finite fields
Polly cracker, revisited
Need polynomial systems be doubly-exponential?
Quantum algorithm for Boolean equation solving and quantum algebraic attack on cryptosystems
A subresultant-like theory for Buchberger's procedure
Uniqueness of limit cycles for sewing planar piecewise linear systems
Complexity bounds on Semaev's naive index calculus method for ECDLP
Semi-regular sequences and other random systems of equations
Stability of Gröbner bases
An algebraic attack on rank metric code-based cryptosystems
Solving multivariate polynomial systems and an invariant from commutative algebra
A new efficient algorithm for computing Gröbner bases (F₄)
A survey on signature-based algorithms for computing Gröbner bases
Generalization of the F5 algorithm for calculating Gröbner bases for polynomial ideals
First order perturbation and local stability of parametrized systems
F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases
On the complexity of solving generic overdetermined bilinear systems
The analytic standard fan of a $\mathcal D$-module
Effective power series computations
Probabilistic analysis on Macaulay matrices over finite fields and complexity of constructing Gröbner bases
scientific article; zbMATH DE number 957489 (Why is no real title available?)
Algebraic approaches for the design of simultaneous observers for linear systems
A solution to Kronecker's problem
Multidimensional realisation theory and polynomial system solving
Computing Gröbner Bases within Linear Algebra
On the complexity exponent of polynomial system solving
An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals, and applications to commutative semigroups
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
A single exponential time algorithm for homogeneous regular sequence tests
Computing comprehensive Gröbner systems: a comparison of two methods
Nonlinear reduction for solving deficient polynomial systems by continuation methods
Breaking rainbow takes a weekend on a laptop
Efficient computation of Castelnuovo-Mumford regularity
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
Degree upper bounds for involutive bases
The virtues of laziness: Complexity of the tangent cone algorithm
Encoding algebraic power series
Dimension and depth dependent upper bounds in polynomial ideal theory
Signature-based standard basis algorithm under the framework of GVW algorithm
Solving degree, last fall degree, and related invariants
On the Jacobian conjecture: A new approach via Gröbner bases
An algorithmic approach to Chevalley’s Theorem on images of rational morphisms between affine varieties
The F5 criterion revised
Refined F5 Algorithms for Ideals of Minors of Square Matrices
Separating linear forms and rational univariate representations of bivariate systems
An improvement over the GVW algorithm for inhomogeneous polynomial systems
Syzygies among reduction operators
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
CAD and topology of semi-algebraic sets
On the complexity of the $F_5$ Gröbner basis algorithm
Computing syzygies by Faugère's $\mathbb{F}_{5}$ algorithm
Recent improvements in the complexity of the effective Nullstellensatz
An involutive GVW algorithm and the computation of Pommaret bases
Cryptanalysis of the extension field cancellation cryptosystem
Computer algebra: Past and future
Normal forms of planar polynomial differential systems
A dynamic F4 algorithm to compute Gröbner bases
Improved agreeing-gluing algorithm
A Note on Dynamic Gröbner Bases Computation
On the complexity of the generalized MinRank problem
The complexity of algebraic algorithms for LWE
Using symmetries in the index calculus for elliptic curves discrete logarithm
The d-step conjecture and Gaussian elimination
Involutive bases in the Weyl algebra.
Degree bounds for Gröbner bases in algebras of solvable type
On the computation of generalized standard bases
La queste del Saint $\text{Gr}_ a(\text{AL})$: A computational approach to local algebra
Computing H-bases via minimal bases for syzygy modules
Secure PRNGs from Specialized Polynomial Maps over Any $\mathbb{F}_{q}$

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)