Why almost all kcolorable graphs are easy为什么几乎所有的图都是简单的构成.pptVIP

* Amiri Skvortsov * * * * * Satisfiable k-CNF formulas above the threshold 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 )?… x6 x5 x4 x3 x2 x1 T F F T F F Goal: algorithm that produces optimal result, efficient, and works for all inputs SAT - More 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 Many researchers take the heuristical approach Typical instance? One possibility: random models, average case analysis Heuristic is a polynomial time algorithm that produces optimal results on typical instances Random SAT Distributions Most popular k-SAT distribution is the uniform distribution: Fix c,k and chose u.a.r. m=cn clauses out of possible clauses [Fri99] Phase Transition: there exists a number d=d(k,n) such that m/nd: most k-CNFs are not satisfiable (k=3, d4.506, [DBM00]) m/nd : most k-CNF’s are satisfiable (d3.42, [KKL02]) Simple upper bound on d - 2kln2 Proof idea: pick (2kln2)n random clauses; the expected number of satisfying assignments goes from !(1) to o(1) Too far off for small k: 23ln2 ≈ 5.545 (in particular, no tight concentration) Major open question: what is the correct value of d? Conjectured: 2kln2-c, c some universal constant Proven so far: at least 2kln2-k/2 [AP05] Random SAT cont. The below threshold regime was extensively studied (satisfiability) : Rigorous analysis of heuristics: Pure Literal [BFU93], RWalkSAT [AB03] Experimental results: Survey Propagation [BMZ05] The typical structure of the solution space (clustering) [AR06, MMZ05] Focus on near-threshold formulas: trying to figure out the threshold Above-threshold regime is interesting mathematically and algorithmically The above-threshold regime is not necessarily “easy” Why not consider a satisfiable 3CNF