Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. R. Beigel and D. Eppstein. 3-coloring in time O(1.3446n): a no-MIS algorithm. Proc. 36th IEEE Symp. on Foundations of Computer Science, pages 444–452, 1995.
2. P. Beame and T. Pitassi. Simplified and improved resolution lower bounds. Proc. 37th IEEE Symp. on Foundations of Computer Science, 1996.
3. M. Clegg, J. Edmonds, and R. Impagliazzo. Using the Groebner basis algorithm to find proofs of unsatisfiability. Proc. 28th ACM Symposium on Theory of Computing, pages 174–183, 1996.
4. O. Dubois. Counting the number of solutions for instances of satisfiability. Theor. Comput. Sci., 81:49–64, 1991.
5. A. Haken. The intractability of resolution. Theor. Compout. Sci., pages 297–308, 1985.
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献