41 results found in 7 ms.
Page 1 of 3 next
More OCW like this |
|
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
File: 18-409-fall-2009.zip
This OER is part of OCW: Topics in Theoretical Computer Science: An Algorithmist's Toolkit
Published under: /Download Course Materials
Share in:
Used by:
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
File: MIT18_409F09_ps2.pdf
This OER is part of OCW: Topics in Theoretical Computer Science: An Algorithmist's Toolkit
Published under: /Assignments
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
File: MIT18_409F09_ps3.pdf
This OER is part of OCW: Topics in Theoretical Computer Science: An Algorithmist's Toolkit
Published under: /Assignments
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
File: MIT18_409F09_ps1.pdf
This OER is part of OCW: Topics in Theoretical Computer Science: An Algorithmist's Toolkit
Published under: /Assignments
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
More OERs like this |
|
Pages: 2
This OER is part of OCW: Topics in Theoretical Computer Science: An Algorithmist's Toolkit
Published under: /Assignments
This OER is part of OCW: Topics in Theoretical Computer Science: An Algorithmist's Toolkit
Published under: /Assignments
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
More OERs like this |
|
Pages: 9
This OER is part of OCW: Topics in Theoretical Computer Science: An Algorithmist's Toolkit
Published under: /Assignments
This OER is part of OCW: Topics in Theoretical Computer Science: An Algorithmist's Toolkit
Published under: /Assignments
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
File: ch4.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
More OERs like this |
|
Pages: 4
This OER is part of OCW: Topics in Theoretical Computer Science: An Algorithmist's Toolkit
Published under: /Readings
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
More OERs like this |
|
Pages: 9
This OER is part of OCW: Topics in Theoretical Computer Science: An Algorithmist's Toolkit
Published under: /Readings
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
File: ch3.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
File: ch1.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
More OERs like this |
|
Pages: 8
This OER is part of OCW: Topics in Theoretical Computer Science: An Algorithmist's Toolkit
Published under: /Readings
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
File: bib.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
File: ch2.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
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
41 results found.
Page 1 of 3 next