Food verb transportation animal verb furniture Find!Find! Fill out letters on the right, to satisfy as much of the constraints on the left.

Slides:

Advertisements

Similar presentations

Sublinear Algorithms … Lecture 23: April 20.

Advertisements

Parallel Repetition of Two Prover Games Ran Raz Weizmann Institute and IAS.

Direct Product : Decoding & Testing, with Applications Russell Impagliazzo (IAS & UCSD) Ragesh Jaiswal (Columbia) Valentine Kabanets (SFU) Avi Wigderson.

Inapproximability of MAX-CUT Khot,Kindler,Mossel and O ’ Donnell Moshe Ben Nehemia June 05.

Gillat Kol joint work with Ran Raz Locally Testable Codes Analogues to the Unique Games Conjecture Do Not Exist.

Dana Moshkovitz MIT Joint work with Subhash Khot, NYU 1.

Inapproximability Seminar – 2005 David Arnon  March 3, 2005 Some Optimal Inapproximability Results Johan Håstad Royal Institute of Technology, Sweden.

F(x,y) = x 2 y + y y  f — = f x =  x 2xyx 2 + 3y y ln2 z = f(x,y) = cos(xy) + x cos 2 y – 3  f — = f y =  y  z —(x,y) =  x – y sin(xy)

AM With Multiple Merlins Scott Aaronson MIT Scott Aaronson (MIT) Dana Moshkovitz (MIT) Russell Impagliazzo (UCSD)

Approximating Maximum Subgraphs Without Short Cycles Guy Kortsarz Join work with Michael Langberg and Zeev Nutov.

Parallel Repetition From Fortification Dana Moshkovitz MIT.

Constraint Satisfaction over a Non-Boolean Domain Approximation Algorithms and Unique Games Hardness Venkatesan Guruswami Prasad Raghavendra University.

Dana Moshkovitz. Back to NP L  NP iff members have short, efficiently checkable, certificates of membership. Is  satisfiable?  x 1 = truex 11 = true.

Two Query PCP with Subconstant Error Dana Moshkovitz Princeton University and The Institute for Advanced Study Ran Raz The Weizmann Institute 1.

Probabilistically Checkable Proofs (and inapproximability) Irit Dinur, Weizmann open day, May 1 st 2009.

Introduction to PCP and Hardness of Approximation Dana Moshkovitz Princeton University and The Institute for Advanced Study 1.

A 3-Query PCP over integers a.k.a Solving Sparse Linear Systems Prasad Raghavendra Venkatesan Guruswami.

1/17 Optimal Long Test with One Free Bit Nikhil Bansal (IBM) Subhash Khot (NYU)

Complexity ©D.Moshkovits 1 Hardness of Approximation.

Umans Complexity Theory Lectures Lecture 15: Approximation Algorithms and Probabilistically Checkable Proofs (PCPs)

Inapproximability from different hardness assumptions Prahladh Harsha TIFR 2011 School on Approximability.

Two Query PCP with Sub-constant Error Dana Moshkovitz Princeton University Ran Raz Weizmann Institute 1.

PCPs and Inapproximability Introduction. My T. Thai 2 Why Approximation Algorithms  Problems that we cannot find an optimal solution.

Thomas Holenstein Microsoft Research, SVC Dagstuhl

Dictator tests and Hardness of approximating Max-Cut-Gain Ryan O’Donnell Carnegie Mellon (includes joint work with Subhash Khot of Georgia Tech)

The number of edge-disjoint transitive triples in a tournament.

Approximate Counting via Correlation Decay Pinyan Lu Microsoft Research.

Introduction to Approximation Algorithms Lecture 12: Mar 1.

Approximation Algoirthms: Semidefinite Programming Lecture 19: Mar 22.

Semidefinite Programming

1 COMPOSITION PCP proof by Irit Dinur Presentation by Guy Solomon.

Michael Bender - SUNY Stony Brook Dana Ron - Tel Aviv University Testing Acyclicity of Directed Graphs in Sublinear Time.

Analysis of Algorithms CS 477/677

Job Scheduling Lecture 19: March 19. Job Scheduling: Unrelated Multiple Machines There are n jobs, each job has: a processing time p(i,j) (the time to.

Expanders Eliyahu Kiperwasser. What is it? Expanders are graphs with no small cuts. The later gives several unique traits to such graph, such as: – High.

1 On the Computation of the Permanent Dana Moshkovitz.

Complexity ©D.Moshkovits 1 Hardness of Approximation.

Linear Programming and Parameterized Algorithms. Linear Programming n real-valued variables, x 1, x 2, …, x n. Linear objective function. Linear (in)equality.

Reflexive -- First sentence of proof is: (1) Let x  Z (2) Let (x,x)  R. (3) Let (x,x)  I (4) Let x  R.

E3-LIN-2 is hard to approximate Hastad Speaker : Guy Kindler.

1 Spanning Tree Polytope x1 x2 x3 Lecture 11: Feb 21.

Finding Almost-Perfect

Dana Moshkovitz MIT.  Take-home message: Prove hardness results assuming The Projection Games Conjecture (PGC)! Theorem: If SAT requires exponential.

Dana Moshkovitz, MIT Joint work with Subhash Khot, NYU.

Puzzle 1. food verb transportation animal verb furniture Find!Find! Score: Your turn: How much can you score?

Correlation testing for affine invariant properties on Shachar Lovett Institute for Advanced Study Joint with Hamed Hatami (McGill)

Bypassing the Unique Games Conjecture for two geometric problems Yi Wu IBM Almaden Research Based on joint work with Venkatesan Guruswami Prasad Raghavendra.

Sub-Constant Error Low Degree Test of Almost-Linear Size Dana Moshkovitz Weizmann Institute Ran Raz Weizmann Institute.

Proofs 1/25/12.

Direct-product testing, and a new 2-query PCP Russell Impagliazzo (IAS & UCSD) Valentine Kabanets (SFU) Avi Wigderson (IAS)

EMIS 8373: Integer Programming NP-Complete Problems updated 21 April 2009.

Techniques for Proving NP-Completeness Show that a special case of the problem you are interested in is NP- complete. For example: The problem of finding.

Yuan Zhou Carnegie Mellon University Joint works with Boaz Barak, Fernando G.S.L. Brandão, Aram W. Harrow, Jonathan Kelner, Ryan O'Donnell and David Steurer.

1/19 Minimizing weighted completion time with precedence constraints Nikhil Bansal (IBM) Subhash Khot (NYU)

Minicourse on parameterized algorithms and complexity Part 4: Linear programming Dániel Marx (slides by Daniel Lokshtanov) Jagiellonian University in Kraków.

Unique Games Approximation Amit Weinstein Complexity Seminar, Fall 2006 Based on: “Near Optimal Algorithms for Unique Games" by M. Charikar, K. Makarychev,

Yuan Zhou, Ryan O’Donnell Carnegie Mellon University.

5-4 The Triangle Inequality. Triangle Inequality Theorem: The sum of two lengths in a triangle is always greater than the third length. Aulisio cut to.

Computability Examples. Reducibility. NP completeness. Homework: Find other examples of NP complete problems.

1. C 2. I 3. D TERMS 2x + 8 Has 2 terms 2x + 8 Has 2 terms An expression with ANY NUMBER of terms is called a ___________________ are separated.

Yuan Zhou Carnegie Mellon University Joint works with Boaz Barak, Fernando G.S.L. Brandão, Aram W. Harrow, Jonathan Kelner, Ryan O'Donnell and David Steurer.

Finding Almost-Perfect

Polynomial integrality gaps for

Dana Moshkovitz The Institute For Advanced Study

Sum of Squares, Planted Clique, and Pseudo-Calibration

Possibilities and Limitations in Computation

Venkatesan Guruswami Yuan Zhou (Carnegie Mellon University)

Introduction to PCP and Hardness of Approximation

2-to-2 Games Theorem via Expansion in the Grassmann Graph

Lecture 24 Vertex Cover and Hamiltonian Cycle

Presentation transcript:

food verb transportation animal verb furniture Find!Find! Fill out letters on the right, to satisfy as much of the constraints on the left.

b a t bat food verb transportation animal verb furniture Find!Find! When the letters form a word in a category, get 1 point per letter. Score: 3

b c a b t bat food verb transportation animal verb furniture Find!Find! When the letters form a word in a category, get 1 point per letter. cab Score: 6

b c a b t bat food verb transportation animal verb furniture Find!Find! When the letters form a word in a category, get 1 point per letter. cab Score: 6

b c a b e t bat food verb transportation animal verb furniture Find!Find! When the letters partially match a word in a category, get 1 point per match. cab bed Score: 8

b c a b e t y bat food verb transportation animal verb furniture Find!Find! cab bed Score: 10 cry When the letters partially match a word in a category, get 1 point per match.

b c a b e t y bat food verb transportation animal verb furniture Find!Find! cab bed Score: 10 cry ?ay When the letters partially match a word in a category, get 1 point per match.

b c a b e t y bat food verb transportation animal verb furniture Find!Find! cab bed Score: 10 cry ?ey ?ay When the letters partially match a word in a category, get 1 point per match.

b p c a b e t y bat food verb transportation animal verb furniture Find!Find! cab bed Score: 15 cry pea pay When the letters partially match a word in a category, get 1 point per match.

food verb transportation animal verb furniture Find!Find! Score: Your turn: How much can you score?

b p c a b e t y bat pay cab pea bed cry food verb transportation animal verb furniture Find!Find! To get the total score, sum up the points from all the categories. Score: 15

furniture c s c a r o t y cat say car soy cot cry food verb transportation animal verb Find!Find! Perfect score! Score: 18

Given a projection game so that perfect score is achievable, can you score 1% ? Projection games Dana Moshkovitz MIT CSAIL

Given a projection game so that perfect score is achievable. Can you get a perfect score ?

Given a projection game so that perfect score is achievable. Can you score 99% ?

Given a projection game so that perfect score is achievable. Can you score 75% ?

Given a projection game so that perfect score is achievable. Can you score 50% ?

Observations: 1.If there are X edges, can always score 1/X.

Observations: 1.If there are X edges, can always score 1/X. 2.If each constraint is on X locations, can score 1/X.

Observations: 1.If there are X edges, can always score 1/X. 2.If each constraint is on X locations, can score 1/X. 3.If each location is in X constraints, can score 1/X.

Observations: 1.If there are X edges, can always score 1/X. 2.If each constraint is on X locations, can score 1/X. 3.If each location is in X constraints, can score 1/X. 4.If all categories are of size X, can score 1/X. All 3 letter words under “food”

Observations: 1.If there are X edges, can always score 1/X. 2.If each constraint is on X locations, can score 1/X. 3.If each location is in X constraints, can score 1/X. 4.If all categories are of size X, can score 1/X. 5.If the alphabet is of size X, can score 1/X.

Given a projection game with large categories, alphabet and degrees, so perfect score is achievable. Can you score 1% ?

Projection Games Theorem (M-Raz 08): There exists  >0 such that for all  =  (n)  1/n , there exist k=poly(1/  ), D=poly(1/  ), so given a projection game of size n, alphabet size  k and degrees  D, where perfect score is achievable, NP-hard to score even  percent. More than that – Almost as hard as exact 3SAT.

approx 1 2  (n) n O(1) exponential polynomial time Exponential hardness Sharp threshold t From Trivial To Super-Hard In A Flash! [Håstad 97, M-Raz 08] Assuming that exact SAT takes exponential time

The best hardness of approximation results we know are based on projection games Max-3SATMax-3LIN Max-CSPSet-Cover Clique Independent Set Densest Subgraph Closest Vector Problem Directed Sparsest Cut Directed Multi-cut K-Spanner…..

Probabilistic Checking of Proofs (PCP) [FGLSS 91] Proof: 1. ∀ x;x=y ⇒ (x=z ⇒ y=z) 2. ∀ x;x=y ⇒ (x=z ⇒ y=z) ⇒ x+0=y ⇒ (x+0=z ⇒ y=z) 3. x+0=y ⇒ (x+0=z ⇒ y=z) … Conjecture: = 2

Conjecture: A + B = C Probabilistic Checking of Proofs (PCP) [FGLSS 91] Proof: 1. ∀ x;x=y ⇒ (x=z ⇒ y=z) 2. ∀ x;x=y ⇒ (x=z ⇒ y=z) ⇒ x+0=y ⇒ (x+0=z ⇒ y=z) 3. x+0=y ⇒ (x+0=z ⇒ y=z) … w p s i i t n win pi wit it in

Probabilistic Checking of Proofs (PCP) [FGLSS 91] Proof: 1. ∀ x;x=y ⇒ (x=z ⇒ y=z) 2. ∀ x;x=y ⇒ (x=z ⇒ y=z) ⇒ x+0=y ⇒ (x+0=z ⇒ y=z) 3. x+0=y ⇒ (x+0=z ⇒ y=z) … Conjecture: A + B = C False! Score  

Conjecture: A + B = C Probabilistic Checking of Proofs (PCP) [FGLSS 91] Proof: 1. ∀ x;x=y ⇒ (x=z ⇒ y=z) 2. ∀ x;x=y ⇒ (x=z ⇒ y=z) ⇒ x+0=y ⇒ (x+0=z ⇒ y=z) 3. x+0=y ⇒ (x+0=z ⇒ y=z) … w p s i i t n Observe: The PCP Thm induces a new format for proofs; can be tested by checking one implication! win pi wit it in

What Goes Into PCPs? Algebra polynomials over finite fields.. Analysis Fourier, isoperimetry.. Combinatorics expanders,..

Favorite Open Problems Projection Games Conjecture: Projection games NP-hard even when all categories are of size poly(1/  ). Unique Games Conjecture: Projection games NP-hard even when in each category all possible words differ in all their letters; best score is (1-  ) fraction of maximum.