city:"Cambridge, Massachusetts"
continent:"North America"
country:"United States"
language:"English"
language:"English"
tags:" cheeger inequalities"
tags:" convex geometry"
tags:" lattices and basis reduction"
tags:" lps and sdps for approximating np-hard problems"
university_name:"Massachusetts Institute of Technology"
university_name:"Massachusetts Institute of Technology"
Categories
1 results found in 32 ms.
Page 1 of 1
File: ball.pdf
This OER is part of OCW: Topics in Theoretical Computer Science: An Algorithmist's Toolkit
Published under: /Readings
Share in:
OCW Authors:
Inherited 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