tags%3A%22 lps and sdps for approximating np-hard problems%22 tags%3A%22 graph laplacians%22 tags%3A%22spectral graph theory%22 tags%3A%22 lps and sdps for approximating np-hard problems%22 tags%3A%22 lps and sdps for approximating np-hard problems%22 language:"English"
Categories
1 results found in 12 ms.

Page 1 of 1

Topics in Theoretical Computer Science: An Algorithmist's Toolkit

Open CourseWare
More OCW like this | |
Published by: Massachusetts Institute of Technology | Language: English
Share in: Share this resource in Facebook Share this resource in Twitter Share this resource in LinkedInd Share this resource in Google+ Share this resource in Pinterest Share this resource in Blogger Share this resource in Tumblr

This course covers a collection of geometric techniques that apply broadly in modern algorithm design.
Author(s):
Tag(s):


1 results found.

Page 1 of 1