Author:
Achlioptas Dimitris,Kirousis Lefteris M.,Kranakis Evangelos,Krizanc Danny
Subject
General Computer Science,Theoretical Computer Science
Reference38 articles.
1. D. Achlioptas, Setting two variables at a time yields a new lower bound for random 3-SAT, in: 32nd Ann. ACM Symp. on Theory of Computing, Portland, OR, 2000, ACM, New York, 2000, pp. 28–37.
2. D. Achlioptas, L.M. Kirousis, E. Kranakis, D. Krizanc, Rigorous results for random (2+p)-SAT, in: RALCOM ’97, Santorini, 1997, 1997, pp. 1–13.
3. D. Achlioptas, L.M. Kirousis, E. Kranakis, D. Krizanc, M. Molloy, Y. Stamatiou, Random constraint satisfaction: a more accurate picture, Constraints, to appear.
4. D. Achlioptas, M. Molloy, The analysis of a list-coloring algorithm on a random graph, in: 38th Ann. Symp. on Foundations of Computer Science, Miami, FL, 1997, IEEE Comput. Soc. Press, Los Alamitos, CA, 1997, pp. 204–212.
5. Propositional proof complexity: past, present, and future;Beame;Bull. Eur. Assoc. Theoret. Comput. Sci. EATCS,1998
Cited by
47 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily;Theory and Applications of Satisfiability Testing – SAT 2021;2021
2. Super solutions of random (3 + p)-SAT;Theoretical Computer Science;2019-11
3. On the Lower Bounds of (1,0)-Super Solutions for Random k-SAT;International Journal of Foundations of Computer Science;2019-02
4. Sharpness of the Satisfiability Threshold for Non-uniform Random k-SAT;Theory and Applications of Satisfiability Testing – SAT 2018;2018
5. $(2+\varepsilon)$-Sat Is NP-hard;SIAM Journal on Computing;2017-01