arXiv · cond-mat/0309240
Percolation of satisfiability in finite dimensions
Abstract
The satisfiability and optimization of finite-dimensional Boolean formulas are studied using percolation theory, rare region arguments, and boundary effects. In contrast with mean-field results, there is no satisfiability transition, though there is a logical connectivity transition. In part of the disconnected phase, rare regions lead to a divergent running time for optimization algorithms. The thermodynamic ground state for the NP-hard two-dimensional maximum-satisfiability problem is typically unique. These results have implications for the computational study of disordered materials.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
J. M. Schwarz, A. Alan Middleton. 2003-09-10. Percolation of satisfiability in finite dimensions. https://doi.org/10.1103/physreve.70.035103
Cite the original work for its findings. Save a collection to share your selection of sources.