Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference109 articles.
1. A sharp threshold in proof complexity;Achlioptas,2001
2. D. Achlioptas, C.P. Gomes, H.A. Kautz, B. Selman, Generating satisfiable problem instances, in: AAAI/IAAI, 2000, pp. 256–261.
3. Rigorous results for (2+p)-sat;Achlioptas;Theoret. Comput. Sci.,2001
4. F.A. Aloul, I.L. Markov, K.A. Sakallah, Efficient symmetry breaking for boolean satisfiability, in: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), 2003.
5. F. Aloul, A. Ramani, I. Markov, K. Sakallah, Generic ilp versus specialized 0-1 ilp: an update, in: International Conference on Computer Aided Design (ICCAD), 2002.
Cited by
34 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献