Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions (Q5157832): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1707.04618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Communication in Numerical Linear Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph expansion and communication costs of fast matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Brascamp-Lieb inequalities: Finiteness, structure and extremals / rank
 
Normal rank
Property / cites work
 
Property / cites work: The I/O complexity of Strassen's matrix multiplication with recomputation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fiedler Vector of a Laplacian Tensor for Hypergraph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric Tensors and Symmetric Tensor Rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards an efficient use of the BLAS library for multilinear tensor contractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication lower bounds for distributed-memory matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor Decompositions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Basic Linear Algebra Subprograms for Fortran Usage / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inequality related to the isoperimetric inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Can We Speed Up Matrix Multiplication? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating Higher-Order Moments Using Symmetric Tensor Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian elimination is not optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bulk-synchronous parallel random access machine / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3199939468 / rank
 
Normal rank

Latest revision as of 10:11, 30 July 2024

scientific article; zbMATH DE number 7411922
Language Label Description Also known as
English
Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions
scientific article; zbMATH DE number 7411922

    Statements

    Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 October 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    tensors
    0 references
    communication lower bounds
    0 references
    bilinear algorithms
    0 references
    tensor contractions
    0 references
    tensor symmetry
    0 references
    quantum chemistry
    0 references
    0 references
    0 references