Author:
Achlioptas Dimitris,Naor Assaf,Peres Yuval
Publisher
Springer Science and Business Media LLC
Reference25 articles.
1. Cook, S. A. The complexity of theorem-proving procedures. Proc. 3rd Ann. ACM Symp. on Theory of Computing 151–158 (1971)
2. Cheeseman, P., Kanefsky, B. & Taylor, W. Where the really hard problems are. Proc. 12th Int. Joint Conf. on Artificial Intelligence 331–337 (1991)
3. Selman, B., Levesque, H. & Mitchell, D. Hard and easy distributions of SAT problems. Proc. 10th Nat. Conf. on Artificial Intelligence 459–465 (1992)
4. Kirkpatrick, S. & Selman, B. Critical behavior in the satisfiability of random boolean expressions. Science 264, 1297–1301 (1994)
5. Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B. & Troyansky, L. Determining computational complexity from characteristic ‘phase transitions’. Nature 400, 133–137 (1999)
Cited by
175 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Graphical #SAT Algorithm for Formulae with Small Clause Density;Electronic Proceedings in Theoretical Computer Science;2024-08-12
2. Local Geometry of NAE-SAT Solutions in the Condensation Regime;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
3. The $k$-XORSAT Threshold Revisited;The Electronic Journal of Combinatorics;2024-04-19
4. One-Step Replica Symmetry Breaking of Random Regular NAE-SAT II;Communications in Mathematical Physics;2024-02-23
5. Tractability from overparametrization: the example of the negative perceptron;Probability Theory and Related Fields;2024-01-22