Optimization and Physics: On the satisfiability of random Boolean formulae
无序系统与神经网络
2009-11-07 v2
摘要
LECTURE GIVEN AT TH2002. Given a set of Boolean variables, and some constraints between them, is it possible to find a configuration of the variables which satisfies all constraints? This problem, which is at the heart of combinatorial optimization and computational complexity theory, is used as a guide to show the convergence between these fields and the statistical physics of disordered systems. New results on satisfiability, both on the theoretical and practical side, can be obtained thanks to the use of physics concepts and methods.
引用
@article{arxiv.cond-mat/0212448,
title = {Optimization and Physics: On the satisfiability of random Boolean formulae},
author = {Marc Mezard},
journal= {arXiv preprint arXiv:cond-mat/0212448},
year = {2009}
}
备注
Proceedings of the conference TH2002. 8 pages, 4 figures. Corrected typos