<--- Back to Details
First PageDocument Content
Matrix theory / Numerical linear algebra / Submodular set function / Matroid / Combinatorics / Circuit complexity / Matrix multiplication / State / Mathematics / Algebra / Computational complexity theory
Date: 2014-11-06 11:23:26
Matrix theory
Numerical linear algebra
Submodular set function
Matroid
Combinatorics
Circuit complexity
Matrix multiplication
State
Mathematics
Algebra
Computational complexity theory

Research Statement Yuval Filmus November 6, 2014 1

Add to Reading List

Source URL: www.cs.toronto.edu

Download Document from Source Website

File Size: 170,33 KB

Share Document on Facebook

Similar Documents

Mathematics / Algebra / Exponentials / Matrix theory / IP / Summation / Exponentiation

COSC 544 Probabilistic Proof SystemsAn Optimal Interactive Proof for Matrix Multiplication Lecturer: Justin Thaler

DocID: 1xUI5 - View Document

Optimization Techniques for Small Matrix Multiplication ´ Charles-Eric Drevet ´

DocID: 1vrNt - View Document

2018 IEEE International Symposium on High Performance Computer Architecture OuterSPACE: An Outer Product based Sparse Matrix Multiplication Accelerator Subhankar Pal∗ Jonathan Beaumont∗ Dong-Hyeon Park∗ Aporva Ama

DocID: 1uUeI - View Document

0 Autotuning Runtime Specialization for Sparse Matrix-Vector Multiplication BUSE YILMAZ, Ozyegin University BARIS ¸ AKTEMUR, Ozyegin University

DocID: 1uMPm - View Document

Recommended Reading Efficient Parallel Sparse Matrix–Vector Multiplication Using Graph and Hypergraph Partitioning U.V. C

DocID: 1uzWI - View Document