Subject
General Computer Science,Theoretical Computer Science
Reference35 articles.
1. D. Achlioptas, Setting 2 variables at a time yields a new lower bound for random 3-SAT, in: Proc. 32nd ACM Symp. on Theory of Computing, Association for Computing Machinery, New York, 2000.
2. D. Achlioptas, Lower bounds for random 3-SAT via differential equations, Theoret. Comput. Sci. 265 (this vol.) (2001) 159–185.
3. The scaling window of the 2-SAT transition;Bollobás;Random Structures Algorithms,2001
4. Length of prime implicants and number of solutions of random CNF formulae;Boufkhad;Theoret. Comput. Sci.,1999
5. A.Z. Broder, A.M. Frieze, E. Upfal, On the satisfiability and maximum satisfiability of random 3-CNF formulas, in: R. Vijaya (Ed.), Proc. 4th Annu. ACM-SIAM Symp. on Discrete Algorithms, Austin, TX, 1993, ACM, New York, 1993, pp. 322–330.
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Chapter 22. Connections to Statistical Physics;Frontiers in Artificial Intelligence and Applications;2021-02-02
2. Chapter 1. A History of Satisfiability;Frontiers in Artificial Intelligence and Applications;2021-02-02
3. Biased measures for random constraint satisfaction problems: larger interaction range and asymptotic expansion;Journal of Statistical Mechanics: Theory and Experiment;2020-10-01
4. The large deviations of the whitening process in random constraint satisfaction problems;Journal of Statistical Mechanics: Theory and Experiment;2016-05-19
5. Thresholds of Random k-Sat;Encyclopedia of Algorithms;2016