On efficient sparse integer matrix Smith normal form computations (Q597114): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Complexes of not \(i\)-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chessboard Complexes and Matching Complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexes of Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits for the characteristic roots of a matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits for the characteristic roots of a matrix. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regions in the Complex Plane Containing the Eigenvalues of a Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of linear equations using p-adic expansions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Smith form via the valence / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 𝑘^{𝑡ℎ} prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3254327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4248250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix / 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: Parallel algorithms for matrix normal forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring integers with elliptic curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Computing the Smith Normal Form of an Integer Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shift Register Synthesis (Modulo <i>m</i>) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227352 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for characteristic roots of matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving sparse linear equations over finite fields / rank
 
Normal rank

Latest revision as of 17:58, 6 June 2024

scientific article
Language Label Description Also known as
English
On efficient sparse integer matrix Smith normal form computations
scientific article

    Statements

    On efficient sparse integer matrix Smith normal form computations (English)
    0 references
    0 references
    0 references
    0 references
    6 August 2004
    0 references
    parallel computation
    0 references
    algorithm
    0 references
    integer Smith normal form
    0 references
    large sparse matrices
    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