2+p-SAT: Relation of typical-case complexity to the nature of the phase transition

Heuristic methods for solution of problems in the NP-Complete class of decision problems often reach exact solutions, but fail badly at "phase boundaries", across which the decision to be reached changes from almost always having one value to almost having a different value. We report an analytic solution and experimental investigations of the phase transition that occurs in the limit of very large problems in K-SAT. The nature of its "random first-order" phase transition, seen at values of K large enough to make the computational cost of solving typical instances increase exponenitally with problem size, suggest a mechanism for the cost increase. There has been evidence for features like the "backbone" of frozen inputs which characterizes the UNSAT phase in K-SAT in the study of models of disordered materials, but this feature and this transition are uniquely accessible to analysis in K-SAT. The random first order transition combines properties of the 1st order (discontinuous onset of order) and 2nd order (with power law scaling, e.g. of the width of the the critical region in a finite system) transitions known in the physics of pure solids. Such transitions should occur in other combinatoric problems in the large N limit. Finally, improved search heuristics may be developed when a "backbone" is known to exist.

[1]  Yacine Boufkhad,et al.  A General Upper Bound for the Satisfiability Threshold of Random r-SAT Formulae , 1997, J. Algorithms.

[2]  Evangelos Kranakis,et al.  Rigorous results for random (2+p)-SAT , 2001, Theor. Comput. Sci..

[3]  M. Talagrand.  Huge random structures and mean field models for spin glasses. , 1998 .

[4]  S. Kirkpatrick,et al.  Phase transition and search cost in the 2+p-sat problem , 1996 .

[5]  James M. Crawford,et al.  Experimental Results on the Crossover Point inSatis ability , 1993 .

[6]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[7]  Hector J. Levesque,et al.  Hard and Easy Distributions of SAT Problems , 1992, AAAI.

[8]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[9]  R. Palmer,et al.  Introduction to the theory of neural computation , 1994, The advanced book program.

[10]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[11]  J. M. Singer,et al.  Searching for backbones — an efficient parallel algorithm for the traveling salesman problem , 1996 .

[12]  Michael E. Saks,et al.  On the complexity of unsatisfiability proofs for random k-CNF formulas , 1998, STOC '98.

[13]  Anders Krogh,et al.  Introduction to the theory of neural computation , 1994, The advanced book program.

[14]  Antonio Gliozzi,et al.  On the Ground State Structure of P and Np-Complete Random Decision Problems , 1999 .

[15]  N. Sourlas,et al.  The 3d random field Ising model at zero temperature , 1997 .

[16]  Daniel L. Stein,et al.  Lectures In The Sciences Of Complexity , 1989 .

[17]  Alan M. Frieze,et al.  Analysis of Two Simple Heuristics on a Random Instance of k-SAT , 1996, J. Algorithms.

[18]  Yannis C. Stamatiou,et al.  Approximating the unsatisfiability threshold of random formulas , 1998, Random Struct. Algorithms.

[19]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[20]  S. Kirkpatrick,et al.  Configuration space analysis of travelling salesman problems , 1985 .

[21]  B. Hayes.  The American Scientist , 1962, Nature.