Author:
Sakai Takayuki,Seto Kazuhisa,Tamaki Suguru
Publisher
Springer International Publishing
Reference33 articles.
1. Lecture Notes in Computer Science;N. Bansal,1999
2. Binkele-Raible, D., Fernau, H.: A new upper bound for Max-2-SAT: A graph-theoretic approach. J. Discrete Algorithms 8(4), 388–401 (2010)
3. Lecture Notes in Computer Science;I. Bliznets,2012
4. Calabro, C., Impagliazzo, R., Paturi, R.: A duality between clause width and clause density for SAT. In: Proceedings of the 21st Annual IEEE Conference on Computational Complexity (CCC), pp. 252–260 (2006)
5. Lecture Notes in Computer Science;C. Calabro,2009
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献