Konstantinos Georgiou, Periklis A. Papakonstantinou. Complexity and Algorithms for Well-Structured k-SAT Instances. In Hans Kleine Büning, Xishun Zhao, editors, Theory and Applications of Satisfiability Testing - SAT 2008, 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008. Proceedings. Volume 4996 of Lecture Notes in Computer Science, pages 105-118, Springer, 2008. [doi]
@inproceedings{GeorgiouP08,
title = {Complexity and Algorithms for Well-Structured k-SAT Instances},
author = {Konstantinos Georgiou and Periklis A. Papakonstantinou},
year = {2008},
doi = {10.1007/978-3-540-79719-7_10},
url = {http://dx.doi.org/10.1007/978-3-540-79719-7_10},
researchr = {https://researchr.org/publication/GeorgiouP08},
cites = {0},
citedby = {0},
pages = {105-118},
booktitle = {Theory and Applications of Satisfiability Testing - SAT 2008, 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008. Proceedings},
editor = {Hans Kleine Büning and Xishun Zhao},
volume = {4996},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-79718-0},
}