71
Ryan O’Donnell Carnegie Mellon University joint with Gabor Kun (IAS), Suguru Tamaki (Kyoto), Yuichi Yoshida (Kyoto), Yuan Zhou (CMU)

Linear programming, width-1 CSPs, and robust satisfaction

  • Upload
    kieu

  • View
    46

  • Download
    2

Embed Size (px)

DESCRIPTION

Linear programming, width-1 CSPs, and robust satisfaction. Ryan O’Donnell Carnegie Mellon University. joint with Gabor Kun (IAS), Suguru Tamaki (Kyoto), Yuichi Yoshida (Kyoto), Yuan Zhou (CMU). CSPs: 2-Sat, 3-Lin(mod 2), 3-Col, …. - PowerPoint PPT Presentation

Citation preview

Page 1: Linear programming,  width-1  CSPs,  and  robust satisfaction

Ryan O’Donnell

Carnegie Mellon University

joint with

Gabor Kun (IAS), Suguru Tamaki (Kyoto),

Yuichi Yoshida (Kyoto), Yuan Zhou (CMU)

Page 2: Linear programming,  width-1  CSPs,  and  robust satisfaction

CSPs: 2-Sat, 3-Lin(mod 2), 3-Col, …

Page 3: Linear programming,  width-1  CSPs,  and  robust satisfaction

CSPs: 2-Sat, 3-Lin(mod 2), 3-Col, …

Page 4: Linear programming,  width-1  CSPs,  and  robust satisfaction

CSPs: 2-Sat, 3-Lin(mod 2), 3-Col, …

Page 5: Linear programming,  width-1  CSPs,  and  robust satisfaction

CSPs: 2-Sat, 3-Lin(mod 2), 3-Col, …

Page 6: Linear programming,  width-1  CSPs,  and  robust satisfaction
Page 7: Linear programming,  width-1  CSPs,  and  robust satisfaction

Satisfiability Problem

Page 8: Linear programming,  width-1  CSPs,  and  robust satisfaction

Robust Satisfiability Problem Robust

In particular,

solves satisfiability.

Page 9: Linear programming,  width-1  CSPs,  and  robust satisfaction

3-Lin(mod 2): NP-hard to get .51 fraction [Hås97]

Page 10: Linear programming,  width-1  CSPs,  and  robust satisfaction

Sat problem in P

Robust-sat problem in P

All CSPs3-Col

3-Lin(G)

2-Col

Unique-Games2-Sat

Horn-k-Sat

3-Sat

Page 11: Linear programming,  width-1  CSPs,  and  robust satisfaction

Sat problem in P

All CSPs3-Col

3-Lin(G)

2-Col

Unique-Games2-Sat

Horn-k-Sat

3-Sat

Bounded Width

Page 12: Linear programming,  width-1  CSPs,  and  robust satisfaction

Thm: iff cannot gadget-reduce any 3-Lin(G) to it. [BK09]

Page 13: Linear programming,  width-1  CSPs,  and  robust satisfaction

Sat problem in P

Robust-sat problem in PBounded width

All CSPs3-Col

3-Lin(G)

2-Col

Unique-Games2-Sat

Horn-k-Sat

3-Sat

Page 14: Linear programming,  width-1  CSPs,  and  robust satisfaction

Our results

In fact, canonical LP

relaxation solves it.

In fact, canonical LP solves

robust-sat. iff width 1.

Page 15: Linear programming,  width-1  CSPs,  and  robust satisfaction

Sat problem in P

Robust-sat problem in PBounded width

All CSPs

Width 1

3-Col

3-Lin(G)

2-Col

Unique-Games2-Sat

Horn-k-Sat

3-Sat

Page 16: Linear programming,  width-1  CSPs,  and  robust satisfaction
Page 17: Linear programming,  width-1  CSPs,  and  robust satisfaction
Page 18: Linear programming,  width-1  CSPs,  and  robust satisfaction

E.g.: Does 2-Col have width 1?

Page 19: Linear programming,  width-1  CSPs,  and  robust satisfaction

E.g.: Does 2-Col have width 1?

Page 20: Linear programming,  width-1  CSPs,  and  robust satisfaction

E.g.: Does 2-Col have width 1?

Page 21: Linear programming,  width-1  CSPs,  and  robust satisfaction

E.g.: Does 2-Col have width 1?

Page 22: Linear programming,  width-1  CSPs,  and  robust satisfaction

E.g.: Does 2-Col have width 1?

Page 23: Linear programming,  width-1  CSPs,  and  robust satisfaction

E.g.: Does 2-Col have width 1?

Page 24: Linear programming,  width-1  CSPs,  and  robust satisfaction

E.g.: Does 2-Col have width 1?

Page 25: Linear programming,  width-1  CSPs,  and  robust satisfaction

E.g.: Does 2-Col have width 1?

Page 26: Linear programming,  width-1  CSPs,  and  robust satisfaction

E.g.: Does 2-Col have width 1?

Page 27: Linear programming,  width-1  CSPs,  and  robust satisfaction

E.g.: Does 2-Col have width 1?

Page 28: Linear programming,  width-1  CSPs,  and  robust satisfaction

E.g.: Does 2-Col have width 1?

Page 29: Linear programming,  width-1  CSPs,  and  robust satisfaction

E.g.: Does 2-Col have width 1?

Bob can win (play forever), though unsatisfiable.

Page 30: Linear programming,  width-1  CSPs,  and  robust satisfaction

E.g.: Does 2-Col have width 2?

Page 31: Linear programming,  width-1  CSPs,  and  robust satisfaction

E.g.: Does 2-Col have width 2?

Page 32: Linear programming,  width-1  CSPs,  and  robust satisfaction

E.g.: Does 2-Col have width 2?

Page 33: Linear programming,  width-1  CSPs,  and  robust satisfaction

E.g.: Does 2-Col have width 2?

Page 34: Linear programming,  width-1  CSPs,  and  robust satisfaction

E.g.: Does 2-Col have width 2?

Page 35: Linear programming,  width-1  CSPs,  and  robust satisfaction

E.g.: Does 2-Col have width 2?

Page 36: Linear programming,  width-1  CSPs,  and  robust satisfaction

E.g.: Does 2-Col have width 2?

Page 37: Linear programming,  width-1  CSPs,  and  robust satisfaction

E.g.: Does 2-Col have width 2?

Page 38: Linear programming,  width-1  CSPs,  and  robust satisfaction

E.g.: Does 2-Col have width 2?

Page 39: Linear programming,  width-1  CSPs,  and  robust satisfaction

E.g.: Does 2-Col have width 2?

Page 40: Linear programming,  width-1  CSPs,  and  robust satisfaction

E.g.: Does 2-Col have width 2?

Page 41: Linear programming,  width-1  CSPs,  and  robust satisfaction

E.g.: Does 2-Col have width 2?

Page 42: Linear programming,  width-1  CSPs,  and  robust satisfaction

E.g.: Does 2-Col have width 2?

Page 43: Linear programming,  width-1  CSPs,  and  robust satisfaction

E.g.: Does 2-Col have width 2?

Page 44: Linear programming,  width-1  CSPs,  and  robust satisfaction

E.g.: Does 2-Col have width 2?

Page 45: Linear programming,  width-1  CSPs,  and  robust satisfaction

E.g.: Does 2-Col have width 2?

Page 46: Linear programming,  width-1  CSPs,  and  robust satisfaction

E.g.: Does 2-Col have width 2?

Page 47: Linear programming,  width-1  CSPs,  and  robust satisfaction

E.g.: Does 2-Col have width 2?

Page 48: Linear programming,  width-1  CSPs,  and  robust satisfaction

E.g.: Does 2-Col have width 2?

Page 49: Linear programming,  width-1  CSPs,  and  robust satisfaction

E.g.: Does 2-Col have width 2?

Alice can win.

Page 50: Linear programming,  width-1  CSPs,  and  robust satisfaction

E.g.: Does 2-Col have width 2?

Any unsat. 2-Col instance has an odd cycle: Alice can win.

Page 51: Linear programming,  width-1  CSPs,  and  robust satisfaction
Page 52: Linear programming,  width-1  CSPs,  and  robust satisfaction

• ‘Arc Consistency Alg.’ solves satisfiability problem

• it has “tree duality”

• it has a “set operation”

• canonical LP relaxation solves robust-sat. problem

• satisfiability is property-testable [Yos11]

• canonical LP relaxation solves sat. problem

• it has “symmetric polymorphisms of all arities”

• it has a “measure operation”

Theorem 1

Theorem 2

Page 53: Linear programming,  width-1  CSPs,  and  robust satisfaction

• ‘Arc Consistency Alg.’ solves satisfiability problem

• it has “tree duality”

• it has a “set operation”

• canonical LP relaxation solves robust-sat. problem

• satisfiability is property-testable [Yos11]

• canonical LP relaxation solves sat. problem

• it has “symmetric polymorphisms of all arities”

• it has a “measure operation”

Theorem 1

Theorem 2

Page 54: Linear programming,  width-1  CSPs,  and  robust satisfaction

Henceforth, only worry about binary CSPs.

Page 55: Linear programming,  width-1  CSPs,  and  robust satisfaction
Page 56: Linear programming,  width-1  CSPs,  and  robust satisfaction
Page 57: Linear programming,  width-1  CSPs,  and  robust satisfaction
Page 58: Linear programming,  width-1  CSPs,  and  robust satisfaction

Theorem 1:

Page 59: Linear programming,  width-1  CSPs,  and  robust satisfaction

Proof sketch

Page 60: Linear programming,  width-1  CSPs,  and  robust satisfaction
Page 61: Linear programming,  width-1  CSPs,  and  robust satisfaction
Page 62: Linear programming,  width-1  CSPs,  and  robust satisfaction
Page 63: Linear programming,  width-1  CSPs,  and  robust satisfaction
Page 64: Linear programming,  width-1  CSPs,  and  robust satisfaction
Page 65: Linear programming,  width-1  CSPs,  and  robust satisfaction
Page 66: Linear programming,  width-1  CSPs,  and  robust satisfaction
Page 67: Linear programming,  width-1  CSPs,  and  robust satisfaction
Page 68: Linear programming,  width-1  CSPs,  and  robust satisfaction
Page 69: Linear programming,  width-1  CSPs,  and  robust satisfaction
Page 70: Linear programming,  width-1  CSPs,  and  robust satisfaction

Summary

Page 71: Linear programming,  width-1  CSPs,  and  robust satisfaction

Thanks!