On optimizing multiplications of sparse matrices (Q4645925): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/3-540-61310-2_17 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1506547947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4303989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3321331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian elimination is not optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse matrices / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:57, 17 July 2024

scientific article; zbMATH DE number 7000351
Language Label Description Also known as
English
On optimizing multiplications of sparse matrices
scientific article; zbMATH DE number 7000351

    Statements

    On optimizing multiplications of sparse matrices (English)
    0 references
    0 references
    11 January 2019
    0 references
    estimation algorithm
    0 references
    nonzero entry
    0 references
    chain product
    0 references
    sparse matrice
    0 references
    column size
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers