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

Slides:



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

Subhash Khot IAS Elchanan Mossel UC Berkeley Guy Kindler DIMACS Ryan O’Donnell IAS.
Inapproximability of MAX-CUT Khot,Kindler,Mossel and O ’ Donnell Moshe Ben Nehemia June 05.
On the Unique Games Conjecture Subhash Khot Georgia Inst. Of Technology. At FOCS 2005.
Inapproximability Seminar – 2005 David Arnon  March 3, 2005 Some Optimal Inapproximability Results Johan Håstad Royal Institute of Technology, Sweden.
MaxClique Inapproximability Seminar on HARDNESS OF APPROXIMATION PROBLEMS by Dr. Irit Dinur Presented by Rica Gonen.
Prasad Raghavendra University of Washington Seattle Optimal Algorithms and Inapproximability Results for Every CSP?
Lecture 22: April 18 Probabilistic Method. Why Randomness? Probabilistic method: Proving the existence of an object satisfying certain properties without.
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.
Two Query PCP with Subconstant Error Dana Moshkovitz Princeton University and The Institute for Advanced Study Ran Raz The Weizmann Institute 1.
Food verb transportation animal verb furniture Find!Find! Fill out letters on the right, to satisfy as much of the constraints on the left.
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.
Complexity ©D.Moshkovits 1 Hardness of Approximation.
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.
Thomas Holenstein Microsoft Research, SVC Dagstuhl
Venkatesan Guruswami (CMU) Yuan Zhou (CMU). Satisfiable CSPs Theorem [Schaefer'78] Only three nontrivial Boolean CSPs for which satisfiability is poly-time.
1 Tight Hardness Results for Some Approximation Problems [Raz,Håstad,...] Adi Akavia Dana Moshkovitz & Ricky Rosen S. Safra.
Computer Assisted Proof of Optimal Approximability Results Uri Zwick Uri Zwick Tel Aviv University SODA’02, January 6-8, San Francisco.
Vol.1: Geometry Subhash Khot IAS Elchanan Mossel UC Berkeley Guy Kindler DIMACS Ryan O’Donnell IAS.
1 COMPOSITION PCP proof by Irit Dinur Presentation by Guy Solomon.
1 Tight Hardness Results for Some Approximation Problems [mostly Håstad] Adi Akavia Dana Moshkovitz S. Safra.
Integer Programming Difference from linear programming –Variables x i must take on integral values, not real values Lots of interesting problems can be.
Complexity 1 Hardness of Approximation. Complexity 2 Introduction Objectives: –To show several approximation problems are NP-hard Overview: –Reminder:
1 The PCP starting point. 2 Overview In this lecture we’ll present the Quadratic Solvability problem. In this lecture we’ll present the Quadratic Solvability.
Complexity ©D.Moshkovits 1 Hardness of Approximation.
Identify Linear, Quadratic, and Exponential Functions N Distinguish quadratic and exponential functions as nonlinear using a graph and/or a table.
1 The PCP starting point. 2 Overview In this lecture we’ll present the Quadratic Solvability problem. We’ll see this problem is closely related to PCP.
1 Slides by Asaf Shapira & Michael Lewin & Boaz Klartag & Oded Schwartz. Adapted from things beyond us.
Iterated-Tests Hastad, Trevisan, Samorodnitsky, Widgerson Speaker : Guy Kindler.
1 Joint work with Shmuel Safra. 2 Motivation 3 Motivation.
Section 3.2 Systems of Equations in Two Variables  Exact solutions by using algebraic computation  The Substitution Method (One Equation into Another)
1 Hardness Result for MAX-3SAT This lecture is given by: Limor Ben Efraim.
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.
Thinking Mathematically Algebra: Graphs, Functions and Linear Systems 7.3 Systems of Linear Equations In Two Variables.
Solve Systems of Equations By Graphing
Graphing Linear Equations
Is this relation a function? Explain. {(0, 5), (1, 6), (2, 4), (3, 7)} Draw arrows from the domain values to their range values.
Products of Functions, Graphs, Games & Problems Irit Dinur Weizmann.
Hardness of Learning Halfspaces with Noise Prasad Raghavendra Advisor Venkatesan Guruswami.
Direct-product testing, and a new 2-query PCP Russell Impagliazzo (IAS & UCSD) Valentine Kabanets (SFU) Avi Wigderson (IAS)
LINEAR SYSTEMS – Graphing Method In this module, we will be graphing two linear equations on one coordinate plane and seeing where they intersect. You.
Linear Equations in Two Variables A Linear Equation in Two Variables is any equation that can be written in the form where A and B are not both zero.
Lower Bounds for Property Testing Luca Trevisan U.C. Berkeley.
1/19 Minimizing weighted completion time with precedence constraints Nikhil Bansal (IBM) Subhash Khot (NYU)
Non-Approximability Results. Summary -Gap technique -Examples: MINIMUM GRAPH COLORING, MINIMUM TSP, MINIMUM BIN PACKING -The PCP theorem -Application:
Class Opener: Solve each equation for Y: 1.3x + y = y = 2x 3.x + 2y = 5 4. x – y = x + 3y = x – 5y = -3.
SSAT A new characterization of NP and the hardness of approximating CVP. joint work with G., R. Raz, and S. Safra joint work with G. Kindler, R. Raz, and.
1 2 Introduction In this lecture we’ll cover: Definition of PCP Prove some classical hardness of approximation results Review some recent ones.
CS151 Complexity Theory Lecture 15 May 18, Gap producing reductions Main purpose: –r-approximation algorithm for L 2 distinguishes between f(yes)
Algebra 1 Section 4.2 Graph linear equation using tables The solution to an equation in two variables is a set of ordered pairs that makes it true. Is.
Tight Hardness Results for Some Approximation Problems [Håstad]
اختر أي شخصية واجعلها تطير!
Venkatesan Guruswami Yuan Zhou (Carnegie Mellon University)
Equations as Relations
Solve Systems of Equations
Introduction to PCP and Hardness of Approximation
Hardness of Approximation
9.6 Solving Systems of Equations by Graphing
Chapter 8 Systems of Equations 8.1 Solve Systems by Graphing
System of Linear Equations:
Objective The student will be able to:
Objective The student will be able to:
Solutions of Linear Functions
6.2 Using Substitution to Solve Systems
Chapter 8 Systems of Equations
2-to-2 Games Theorem via Expansion in the Grassmann Graph
Presentation transcript:

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

An m-SAT instance   Variables (not necessarily Boolean).  Constraints: Each over m variables.  Example: For all x,y in (Z 2 ) n, A(x)A(y)=A(xy)

An m-CSP instance   Variables (not necessarily Boolean).  Constraints: Each over m variables.  S(  ) – maximum fraction of satisfied constraints.

Cook-Levin  In 3-SAT, it is hard to distinguish between the cases: –S(  )=1 –S(  )<1

PCP LL LL

PCP Theorem PCP LL LL  In 3-SAT, it is hard to distinguish between: S(  )=1 and S(  )<1- 

PCP Theorem PCP LL LL  GAP(1- ,1) 3-SAT, is NP-hard.

Our Goal  Show hardness for GAP(1/2+ ,1-  ) 3-CSP  Whereeach constraint is a linear equation over Z 2

The Scheme 1.From gap 3-SAT to gap( ,1) 2-CSP 2.V  long-code table, constraint(V,U)  linear equations.

par( ,k)   : variables x, constraints c  V=(x 1,x 2,..,x k ) (k-tuple)  U=(c 1,..,c k )  V  U : if x i  c i  One constraint per V  U

Parallel Repetition [Raz] If  is in gap(1- ,1) 3-sat, then par( ,k) has gap (g(  ) k,1) Exercise: par( ,1) has gap (1-  /3,1)

par( ,k) : Forgetful Functor  V-variables over [v]  U-variables over [u]  A constraint over U,V: a function  :[u]-->[v]  If U is assigned i, V should get j=  (i)  Either all constraints are satisfiable, or not even an  -fraction.  Holds for random-assignments as well.

Final System - Variables  For each V: A(y) for every y in (Z 2 ) v.  For each U: B(x) for every x in (Z 2 ) u.  If V is assigned j: A(y) is assigned y j  If U is assigned i: B(x) is assigned x i

Final System - Tests  Pick V,U at random  Pick x in (Z 2 ) u and y in (Z 2 ) v.  Pick  -noize z in (Z 2 ) u  Verify: B(x)A(y)=B(xyz)