Pascal Koiran, Klaus Meer. On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width. In Hajo Broersma, Thomas Erlebach, Tom Friedetzky, Daniël Paulusma, editors, Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers. Volume 5344 of Lecture Notes in Computer Science, pages 252-263, 2008. [doi]
@inproceedings{KoiranMH08,
title = {On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width},
author = {Pascal Koiran and Klaus Meer},
year = {2008},
doi = {10.1007/978-3-540-92248-3_23},
url = {http://dx.doi.org/10.1007/978-3-540-92248-3_23},
tags = {Pascal},
researchr = {https://researchr.org/publication/KoiranMH08},
cites = {0},
citedby = {0},
pages = {252-263},
booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers},
editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Daniël Paulusma},
volume = {5344},
series = {Lecture Notes in Computer Science},
isbn = {978-3-540-92247-6},
}