<--- 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

K. Murota, University of Tokyo, Japan Matrices and Matroids for Systems Analysis A matroid is an abstract mathematical structure that captures combinatorial properties of matrices. This book offers a unique introduction

DocID: 1vdBT - View Document

Special Colloquium Scaling Computer Vision in the Cloud Reza Zadeh Matroid and Stanford

DocID: 1uUMY - View Document

New Perspectives in Geometric Combinatorics MSRI Publications Volume 38, 1999 Matroid Bundles LAURA ANDERSON

DocID: 1uPzZ - View Document

ยจ BOIJ-SODERBERG EXPANSIONS OF MATROID STANLEY-REISNER RINGS ALEX FINK

DocID: 1uOKx - View Document

Matroid Bandits: Practical Large-Scale Combinatorial Bandits Branislav Kveton, Zheng Wen, Azin Ashkan, and Hoda Eydgahi Technicolor Labs Palo Alto, CA {branislav.kveton,zheng.wen,azin.ashkan,hoda.eydgahi}@technicolor.com

DocID: 1uDva - View Document