Subject
General Computer Science,Theoretical Computer Science
Reference29 articles.
1. D. Achlioptas, Lower bounds for random 3-SAT via differential equations, Theoret. Comput. Sci. 265 (this Vol.) (2001) 159–185.
2. D. Achlioptas, Setting 2 variables at a time yields a new lower bound for random 3-sat, 32nd ACM Symp. on Theory of Computing, Association of Computing Machinery, New York, 2000.
3. D. Achlioptas, L.M. Kirousis, E. Kranakis, D. Krizanc, M. Molloy, Y. Stamatiou, Random constraint satisfaction: a more accurate picture, 3rd Conf. on the Principles and Practice of Constraint Programming, Linz, Austria, 1997, Lecture Notes in Computer Science, vol. 1330, Springer, Berlin, 1997, pp. 107–120.
4. D. Achlioptas, M. Molloy, The analysis of a list-coloring algorithm on a random graph, 38th Annu. Symp. on Foundations of Computer Science, Miami, FL, 1997, IEEE Computer Soc. Press, Los Alamitos, CA, 1997, pp. 204–212.
5. D. Achlioptas, G. Sorkin, Optimal policies for greedy 3-sat algorithms, 41st Annu. Symp. on Foundations of Computer Science, IEEE Computer Soc. Press, Los Alamitos, CA, 2000, 590–600.
Cited by
36 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Chapter 22. Connections to Statistical Physics;Frontiers in Artificial Intelligence and Applications;2021-02-02
2. Chapter 10. Random Satisfiabiliy;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. Biased landscapes for random constraint satisfaction problems;Journal of Statistical Mechanics: Theory and Experiment;2019-02-26
5. A Model for Phase Transition of Random Answer-Set Programs;ACM Transactions on Computational Logic;2016-07-22