scientific article; zbMATH DE number 3857249

Publication date 1983

Gaussian elimination Gröbner base systems of algebraic equations

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

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)

Thirty years of polynomial system solving, and now?
Solving polynomial systems via symbolic-numeric reduction to geometric involutive form
Degree bounds for Gröbner bases in algebras of solvable type
A combinatorial approach to involution and -regularity. I: Involutive bases in polynomial algebras of solvable type
Some examples for solving systems of algebraic equations by calculating Gröbner bases
New constructive methods in classical ideal theory
Computer algebra: Past and future
History and basic features of the critical-pair/completion procedure
Solving systems of algebraic equations by a general elimination method
Stability of Gröbner bases
The Gröbner fan of an ideal
Standard bases and geometric invariant theory. I: Initial ideals and state polytopes
Recent improvements in the complexity of the effective Nullstellensatz
Equations for the projective closure and effective Nullstellensatz
La queste del Saint $\text{Gr}_ a(\text{AL})$: A computational approach to local algebra
A note on upper bounds for ideal-theoretic problems
Nonlinear reduction for solving deficient polynomial systems by continuation methods
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
Construction of Gröbner bases for investigation of systems of polynomial equations
A new efficient algorithm for computing Gröbner bases (F₄)
The virtues of laziness: Complexity of the tangent cone algorithm
A solution to Kronecker's problem
The tangent cone algorithm and homogenization
An algorithm of computing $b$-functions
Algorithms for the $b$-function and $D$-modules associated with a polynomial
The d-step conjecture and Gaussian elimination
Computing comprehensive Gröbner systems: a comparison of two methods
Encoding algebraic power series
On the last fall degree of zero-dimensional Weil descent systems
Sparse FGLM algorithms
A survey on signature-based algorithms for computing Gröbner bases
Speeding up the GVW algorithm via a substituting method
Syzygies among reduction operators
Ideal basis and primary decompositions: case of two variables
Involutive bases in the Weyl algebra.
Advances and improvements in the theory of standard bases and syzygies
Elliptic curve discrete logarithm problem over small degree extension fields
Generalization of the F5 algorithm for calculating Gröbner bases for polynomial ideals
Computing tropical points and tropical links
An algorithm for computing the Hilbert-Samuel multiplicities and reductions of zero-dimensional ideals of Cohen-Macaulay local rings
On the use of Buchberger criteria in $\mathrm G^2\mathrm V$ algorithm for calculating Gröbner bases
Complexity bounds on Semaev's naive index calculus method for ECDLP
A dynamic F4 algorithm to compute Gröbner bases
Solving non-linear Boolean equation systems by variable elimination
Cryptanalysis of the extension field cancellation cryptosystem
Degree upper bounds for involutive bases
An involutive GVW algorithm and the computation of Pommaret bases
An algebraic attack on rank metric code-based cryptosystems
Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one
Computation of Macaulay constants and degree bounds for Gröbner bases
An improvement of the rational representation for high-dimensional systems
Quantum algorithm for Boolean equation solving and quantum algebraic attack on cryptosystems
Solving degree, last fall degree, and related invariants
Probabilistic analysis on Macaulay matrices over finite fields and complexity of constructing Gröbner bases
On the termination of the general XL algorithm and ordinary multinomials
Solving multivariate polynomial systems and an invariant from commutative algebra
Improved agreeing-gluing algorithm
The F5 criterion revised
A dimension series for multivariate splines
Dimension and depth dependent upper bounds in polynomial ideal theory
Rayleigh quotient methods for estimating common roots of noisy univariate polynomials
On the complexity of the $F_5$ Gröbner basis algorithm
Uniqueness of limit cycles for sewing planar piecewise linear systems
Gröbner bases of ideals defined by functionals with an application to ideals of projective points
A factorization algorithm for $G$-algebras and its applications
Effective power series computations
Normal forms of planar polynomial differential systems
Computing syzygies by Faugère's $\mathbb{F}_{5}$ algorithm
Involutive bases algorithm incorporating F$_5$ criterion
GVW algorithm over principal ideal domains
A subresultant-like theory for Buchberger's procedure
Tangent cone algorithm for homogenized differential operators
On the complexity exponent of polynomial system solving
Algebraic invariants and local stability of planar differential systems
Need polynomial systems be doubly-exponential?
A Note on Dynamic Gröbner Bases Computation
Polly cracker, revisited
MaxMinMax problem and sparse equations over finite fields
First order perturbation and local stability of parametrized systems
A Variant of the F4 Algorithm
Relative Gröbner-Shirshov bases for algebras and groups.
Breaking an identity-based encryption scheme based on DHIES
On implementing the symbolic preprocessing function over Boolean polynomial rings in Gröbner basis algorithms using linear algebra
A new framework for computing Gröbner bases
Secure PRNGs from Specialized Polynomial Maps over Any $\mathbb{F}_{q}$
On the Number of Linearly Independent Equations Generated by XL
Representing and solving finite-domain constraint problems using systems of polynomials
A Study on Gröbner Basis with Inexact Input
Computing Gröbner Bases within Linear Algebra
A new proof for the correctness of the F5 algorithm
scientific article; zbMATH DE number 4045008 (Why is no real title available?)
Invariant $\mathrm G^2\mathrm V$ algorithm for computing SAGBI-Gröbner bases
On the complexity of the generalized MinRank problem
Characteristic set algorithms for equation solving in finite fields
On the relation between the MXL family of algorithms and Gröbner basis algorithms
scientific article; zbMATH DE number 1254248 (Why is no real title available?)
Multidimensional realisation theory and polynomial system solving
Normal form analysis of Z₂-equivariant singularities
Separating linear forms and rational univariate representations of bivariate systems

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)