Author:
Bailey Delbert D.,Dalmau Víctor,Kolaitis Phokion G.
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference28 articles.
1. D. Achlioptas, 2000. Setting two variables at a time yields a new lower bound for random 3-SAT, in: 32nd Annual ACM Symposium on Theory of Computing, 2000, pp. 28–37.
2. Lower bounds for random 3-SAT via differential equations;Achlioptas;Theoret. Comput. Sci.,2001
3. On counting problems and the polynomial-time hierarchy;Angluin;Theoret. Comput. Sci.,1980
4. R. Bayardo, J. Pehoushek, Counting models using connected components, in: seventeenth National Conference on Artificial Intelligence, 2000, pp. 157–162.
5. The good old Davis–Putnam procedure helps counting models;Birnbaum;J. Artif. Intel. Res.,1999
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献