Skip to main navigation
Skip to search
Skip to main content
Illinois Experts Home
LOGIN & Help
Link opens in a new tab
Search content at Illinois Experts
Home
Profiles
Research units
Research & Scholarship
Datasets
Honors
Press/Media
Activities
COMMUNICATION LOWER BOUNDS of BILINEAR ALGORITHMS for SYMMETRIC TENSOR CONTRACTIONS
Edgar Solomonik
, James Demmel
, Torsten Hoefler
Siebel School of Computing and Data Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'COMMUNICATION LOWER BOUNDS of BILINEAR ALGORITHMS for SYMMETRIC TENSOR CONTRACTIONS'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Bilinear Algorithms
100%
Bilinear Function
33%
Communication Lower Bounds
33%
Computational Chemistry
33%
Contraction Algorithm
33%
Cost Reduction
33%
Data Movement
66%
Data-driven Modeling
33%
Fast Algorithm
33%
Higher-order Moments
33%
Hypergraph
33%
Matrix multiplication
33%
Matrix Rank
33%
Memory Reduction
33%
Minimal Matrices
33%
Modeling Interactions
33%
New Lower Bound
33%
Symmetric Tensor
66%
Symmetry Invariance
33%
Tensor Computation
33%
Tensor Contraction
66%
Tensor Modeling
33%
Tensor Representation
33%
Tensor Symmetry
66%
Mathematics
Bilinear Function
12%
Convolution
12%
Fast Algorithm
12%
Hypergraphs
12%
Matrix (Mathematics)
37%
Multiplication of Matrix
12%
Permutation
25%
Tensor
100%
Engineering
Fast Algorithm
50%
Matrix Multiplication
50%
Symmetric Tensor
100%