language:"English"
tags%3A%22 convex geometry%22
tags%3A%22 graph laplacians%22
tags%3A%22 iterative methods for linear algebra%22
tags%3A%22 lps and sdps for approximating np-hard problems%22
tags:" cheeger inequalities"
tags:" convex geometry"
tags:"spectral graph theory"
university_name%3A%22Massachusetts Institute of Technology%22
Categories
1 results found in 7 ms.
Page 1 of 1
More OCW like this |
|
Published by: Massachusetts Institute of Technology | Language: English
Published by: Massachusetts Institute of Technology | Language: English
Share in:
![Share this resource in Facebook Share this resource in Facebook](/serendipity/img/socialsites/Facebook.png)
![Share this resource in Twitter Share this resource in Twitter](/serendipity/img/socialsites/Twitter.png)
![Share this resource in LinkedIn Share this resource in LinkedInd](/serendipity/img/socialsites/LinkedIn.png)
![Share this resource in Google+ Share this resource in Google+](/serendipity/img/socialsites/Google+.png)
![Share this resource in Pinterest Share this resource in Pinterest](/serendipity/img/socialsites/Pinterest.png)
![Share this resource in Blogger Share this resource in Blogger](/serendipity/img/socialsites/Blogger.png)
![Share this resource in Tumblr Share this resource in Tumblr](/serendipity/img/socialsites/Tumblr.png)
This course covers a collection of geometric techniques that apply broadly in modern algorithm design.
Author(s):
Tag(s):
- mathematics
- spectral graph theory
- iterative methods for linear algebra
- convex geometry
- lattices and basis reduction
- lps and sdps for approximating np-hard problems
- graph laplacians
- cheeger inequalities
- fritz john?s theorem
1 results found.
Page 1 of 1