'Unique games conjecture' presentation slideshows

On the Unique Games Conjecture

1.14k views • 86 slides

Semidefinite Programming and Approximation Algorithms for NP-hard Problems: A Survey

Semidefinite Programming and Approximation Algorithms for NP-hard Problems: A Survey. Sanjeev Arora Princeton University. http://intractability.princeton.edu. NP-completeness. Thousands of problems are NP-complete (TSP, Scheduling, Circuit layout, Machine Learning,..).

538 views • 45 slides

Lasserre Hierarchy, Higher Eigenvalues , and Graph Partitioning

Lasserre Hierarchy, Higher Eigenvalues , and Graph Partitioning. Venkatesan Guruswami Carnegie Mellon University. Joint work with Ali Kemal Sinop. --- Mysore Park Workshop, August 10, 2012 ---. Talk Outline. Introduction to problems we study Laplacian eigenvalues and our results

692 views • 45 slides

Vol.1: Geometry

502 views • 35 slides

food

F i n d !. Fill out letters on the right, to satisfy as much of the constraints on the left. animal. verb. transportation. food. furniture. verb. F i n d !. When the letters form a word in a category, get 1 point per letter. . animal. verb. transportation. food. furniture. verb.

482 views • 32 slides

Avner Magen Joint work with Costis Georgiou, Toni Pitassi and Iannis Tourlakis

441 views • 31 slides

Subexponential Algorithms for Unique Games and Related Problems

Subexponential Algorithms for Unique Games and Related Problems. Sanjeev Arora Princeton University & CCI. Boaz Barak MSR New England & Princeton. David Steurer MSR New England. U. NY area Theory Day, November 2010. WARNING: Some constants have been harmed in the making of this talk.

413 views • 29 slides

392 views • 25 slides