Block-Krylov techniques in the context of sparse-FGLM algorithms (Q2284956): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Created claim: Wikidata QID (P12): Q127469576, #quickstatements; #temporary_batch_1722291251637
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q4714011 / rank
 
Normal rank
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: Q4234296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radical computations of zero-dimensional ideals and real root counting. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Magma algebra system. I: The user language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of special resultants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for zero-dimensional polynomial systems using duality / 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: Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660688 / 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: Sparse FGLM algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the generalized MinRank problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3033872 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online order basis algorithm and its impact on the block Wiedemann algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast projection methods for minimal design problems in linear system theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4550785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of computing determinants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for the characteristic polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On multiplicities in polynomial system solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isolated points, duality and residues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for zero-dimensional ideals using linear recurrent sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of computing with zero-dimensional 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: Extension of the Berlekamp-Massey algorithm to N dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast construction of irreducible polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-order lifting and integrality certification / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general module theoretic framework for vector M-Padé and matrix rational interpolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modern Computer Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving sparse linear equations over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear multivariable systems / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127469576 / rank
 
Normal rank

Latest revision as of 12:53, 30 July 2024

scientific article
Language Label Description Also known as
English
Block-Krylov techniques in the context of sparse-FGLM algorithms
scientific article

    Statements

    Block-Krylov techniques in the context of sparse-FGLM algorithms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 January 2020
    0 references
    polynomial systems
    0 references
    block-Krylov algorithms
    0 references
    sparse FGLM
    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
    0 references

    Identifiers

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