Physics – Condensed Matter – Statistical Mechanics
Scientific paper
2002-06-13
Physics
Condensed Matter
Statistical Mechanics
submitted to Annals of Math and Artificial Intelligence
Scientific paper
The analysis of the solving complexity of random 3-SAT instances using the Davis-Putnam-Loveland-Logemann (DPLL) algorithm slightly below threshold is presented. While finding a solution for such instances demands exponential effort with high probability, we show that an exponentially small fraction of resolutions require a computation scaling linearly in the size of the instance only. We compute analytically this exponentially small probability of easy resolutions from a large deviation analysis of DPLL with the Generalized Unit Clause search heuristic, and show that the corresponding exponent is smaller (in absolute value) than the growth exponent of the typical resolution time. Our study therefore gives some quantitative basis to heuristic restart solving procedures, and suggests a natural cut-off cost (the size of the instance) for the restart.
Cocco Simone
Monasson Remi
No associations
LandOfFree
Restart method and exponential acceleration of random 3-SAT instances resolutions: a large deviation analysis of the Davis-Putnam-Loveland-Logemann algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Restart method and exponential acceleration of random 3-SAT instances resolutions: a large deviation analysis of the Davis-Putnam-Loveland-Logemann algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Restart method and exponential acceleration of random 3-SAT instances resolutions: a large deviation analysis of the Davis-Putnam-Loveland-Logemann algorithm will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-690082