Author:
Zhao Dongdong,Luo Wenjian,Liu Ran,Yue Lihua
Funder
National Natural Science Foundation of China
Subject
Electrical and Electronic Engineering,Artificial Intelligence,Control and Systems Engineering
Reference32 articles.
1. Lower bounds for random 3-SAT via differential equations;Achlioptas;Theor. Comput. Sci.,2001
2. Achlioptas, D., Beame, P., Molloy, M., 2001b. A sharp threshold in proof complexity. in: Proceedings of the Thirty-third Annual ACM Symposium on Theory of Computing, pp. 337–346.
3. The Threshold for Random k-SAT is 2k log2-O(k);Achlioptas;J. Am. Math. Soc,2004
4. Hiding satisfying assignments: two are better than one;Achlioptas;J. Artif. Intell. Res.,2005
5. Random generation of test instances with controlled attributes. DIMACS Series Discrete Math;Asahiro;Theor. Comput. Sci,1996
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献