Why almost all kcolorable graphs are easy Weizmann为什么几乎所有构成的图是容易魏茨曼.pptVIP

It’s all about the support: a new perspective on the satisfiability problem Danny Vilenchik SAT – Basic Notions 3CNF form: F = (x1?x2??x5) ? (x3??x4??x1) ? (x1?x2?x6) ?… ? F = ( F ?F ? T ) ? ( T ? T ? T ) ? ( T ? F ? T )?… SAT – Some Background Finding a satisfying assignment is NP Hard [Cook’71] No approximation for MAX-SAT with factor better than 7/8 [Hastad’01] How to proceed? Hardness results only show that there exist hard instances The heuristical approach - relaxes the universality requirement Typical instance? One possibility: random models Random 3SAT Random 3SAT: Fix m,n Pick m clauses uniformly at random (over the n variables) Threshold: there exists a constant d such that [Fri99] m/n?d: most 3CNFs are not satisfiable (4.506) m/nd : most 3CNFs are satisfiable (3.42) Near-threshold 3CNFs are apparently “hard” for many SAT heuristics Possible reason: complicated structure of solution space (clustering) Motivation – part 1 Experimental results show: takes super-polynomial time for m/n?2.65 Motivation cont. WalkSAT was suggested by Seizt, Alava, Orponen, 2005. For p=0.57, experimental results show polynomial time for m/n?4.2 Already above the clustering threshold (~3.92) What makes this possible? We suggest: taking the support into account WalkSAT is part of the Support Paradigm Our Result – Part 1 We present a simulated-annealing algorithm – SupportSAT In some sense a variation on RWalkSAT that considers the support The algorithm is part of the Support Paradigm Proving rigorously that WalkSAT “works” is a very ambitious task Improving lower bound on the sat threshold from 3.42 to 4.21 Our Result cont. RWalkSAT disregards the support – fails on such instances [AB04] Staying at distance ? n/3 form any satisfying assignment This rigorously mirrors the near-threshold picture for Random 3SAT Experimental results show (random 3SAT): RWalkSAT takes super-polynomial time for m/n?2.65 WalkSAT (Support Paradigm) stays efficient un