authors:"Kelner, Jonathan"
city:"Cambridge, Massachusetts"
continent:"North America"
country:"United States"
language:"English"
language:"English"
license:"Creative Commons Attribution-NonCommercial-ShareAlike 3.0"
tags:" graph laplacians"
tags:" graph laplacians"
tags:"mathematics"
tags:"spectral graph theory"
university_name:"Massachusetts Institute of Technology"
Categories
1 results found in 35 ms.
Page 1 of 1
|
Published by: Massachusetts Institute of Technology | Language: English
Published by: Massachusetts Institute of Technology | Language: English
Share in:
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
Similar courses
-
Description:This course covers a collection of geometric techniques that apply broadly in modern algorithm design.
-
Description:This course covers a collection of geometric techniques that apply broadly in modern algorithm design.
-
Description:This course covers a collection of geometric techniques that apply broadly in modern algorithm design.
1 results found.
Page 1 of 1