Publisher
Springer International Publishing
Reference11 articles.
1. Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of STOC 1978, pp. 216–226. ACM (1978)
2. Cook, S.: The complexity of theorem proving procedures. In: Proceedings of 3rd Annual ACM Symposium on Theory of Computing (STOC), pp. 151–158 (1971)
3. Marques-Silva, J., Practical applications of Boolean Satisfiability. In: 9th International Workshop on Discrete Event Systems, pp. 74–80. IEEE (2008)
4. Schroeppel, R., Shamir, A.: A $$T=O(2^{n/2})$$, $$S=O(2^{n/4})$$ algorithm for certain NP-complete problems. SIAM J. Comput. 10(3), 456–464 (1981)
5. Monien, B., Speckenmeyer, E., Vornberger, O.: Upper bounds for covering problems. Methods Oper. Res. 43, 419–431 (1981)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献