Sparse FGLM algorithms
From MaRDI portal
Publication:1711988
DOI10.1016/j.jsc.2016.07.025zbMath1404.13031arXiv1304.1238OpenAlexW2238531909MaRDI QIDQ1711988
Jean-Charles Faugère, Chenqi Mou
Publication date: 21 January 2019
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.1238
Computational methods for sparse matrices (65F50) Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items
Polynomial-division-based algorithms for computing linear recurrence relations, Gröbner bases and critical values: the asymptotic combinatorics of determinantal systems, Symmetry in multivariate ideal interpolation, In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants, Elimination ideal and bivariate resultant over finite fields, Computing syzygies in finite dimension using fast linear algebra, Chordal graphs in triangular decomposition in top-down style, Parametric FGLM algorithm, Fast computation of generic bivariate resultants, Block-Krylov techniques in the context of sparse-FGLM algorithms, Guessing Gröbner bases of structured ideals of relations of sequences, Exact Algorithms for Linear Matrix Inequalities, Symbolic computation for the qualitative theory of differential equations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using symmetries in the index calculus for elliptic curves discrete logarithm
- Extension of the Berlekamp-Massey algorithm to N dimensions
- The correction capability of the Berlekamp-Massey-Sakata algorithm with majority voting
- A theorem on refining division orders by the reverse lexicographic order
- Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array
- Elimination methods
- Solving zero-dimensional algebraic systems
- Solving zero-dimensional systems through the rational univariate representation
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Converting bases with the Gröbner walk
- On the decoding of cyclic codes using Gröbner bases
- A simple Hankel interpretation of the Berlekamp-Massey algorithm
- Moment matrices, border bases and real radical computation
- On the complexity of the \(F_5\) Gröbner basis algorithm
- Change of order for regular chains in positive dimension
- Linear Algebra for Computing Gröbner Bases of Linear Recursive Multidimensional Sequences
- Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology
- Change of order for bivariate triangular sets
- Sub-cubic change of ordering for Gröbner basis
- A Zero-Dimensional Gröbner Basis for AES-128
- Solving sparse linear equations over finite fields
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- Decoding algebraic-geometric codes up to the designed minimum distance
- Algebraic-geometric codes and multidimensional cyclic codes: a unified theory and algorithms for decoding using Grobner bases
- Critical points and Gröbner bases
- Fast algorithm for change of ordering of zero-dimensional Gröbner bases with sparse multiplication matrices
