Sparse FGLM algorithms (Q1711988): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the complexity of the \(F_5\) Gröbner basis algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on refining division orders by the reverse lexicographic order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4693774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Algebra for Computing Gröbner Bases of Linear Recursive Multidimensional Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The correction capability of the Berlekamp-Massey-Sakata algorithm with majority voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast solution of toeplitz systems of equations and computation of Padé approximants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Zero-Dimensional Gröbner Basis for AES-128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Converting bases with the Gröbner walk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4209232 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Change of order for regular chains in positive dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4317713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new efficient algorithm for computing Gröbner bases \((F_4)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660688 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using symmetries in the index calculus for elliptic curves discrete logarithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sub-cubic change of ordering for Gröbner basis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient computation of zero-dimensional Gröbner bases by change of ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithm for change of ordering of zero-dimensional Gröbner bases with sparse multiplication matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical points and Gröbner bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding algebraic-geometric codes up to the designed minimum distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4050885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4489180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple Hankel interpretation of the Berlekamp-Massey algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Moment matrices, border bases and real radical computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3325833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving zero-dimensional algebraic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the decoding of cyclic codes using Gröbner bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5462454 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4000024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Change of order for bivariate triangular sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving zero-dimensional systems through the rational univariate representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic-geometric codes and multidimensional cyclic codes: a unified theory and algorithms for decoding using Grobner bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension of the Berlekamp-Massey algorithm to N dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4406533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elimination methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving sparse linear equations over finite fields / rank
 
Normal rank

Revision as of 22:04, 17 July 2024

scientific article
Language Label Description Also known as
English
Sparse FGLM algorithms
scientific article

    Statements

    Sparse FGLM algorithms (English)
    0 references
    0 references
    0 references
    21 January 2019
    0 references
    Gröbner bases
    0 references
    change of ordering
    0 references
    zero-dimensional ideal
    0 references
    sparse matrix
    0 references
    Wiedemann algorithm
    0 references
    BMS algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references