Random 3-SAT: The Plot Thickens

  • Authors:

  • Cristian Coarfa;Demetrios D. Demopoulos;Alfonso San Miguel Aguirre;Devika Subramanian;Moshe Y. Vardi

  • Affiliations:

  • Department of Computer Science Rice University 6100 S. Main St MS 132 Houston TX 77005-1892;Department of Computer Science Rice University 6100 S. Main St MS 132 Houston TX 77005-1892;Department of Computer Science Rice University 6100 S. Main St MS 132 Houston TX 77005-1892;Department of Computer Science Rice University 6100 S. Main St MS 132 Houston TX 77005-1892;Department of Computer Science, Rice University, 6100 S. Main St MS 132, Houston TX 77005-1892

  • Venue:
  • Constraints
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents an experimental investigation of the following questions: how does the average-case complexity of random 3-SAT, understood as a function of the order (number of variables) for fixed density (ratio of number of clauses to order) instances, depend on the density? Is there a phase transition in which the complexity shifts from polynomial to exponential in the order? Is the transition dependent or independent of the solver? Our experiment design uses three complete SAT solvers embodying different algorithms: GRASP, CPLEX, and CUDD. We observe new phase transitions for all three solvers, where the median running time shifts from polynomial in the order to exponential. The location of the phase transition appears to be solver-dependent. GRASP shifts from polynomial to exponential complexity near the density of 3.8, CPLEX shifts near density 3, while CUDD exhibits this transition between densities of 0.1 and 0.5. This experimental result underscores the dependence between the solver and the complexity phase transition, and challenges the widely held belief that random 3-SAT exhibits a phase transition in computational complexity very close to the crossover point.