Published in: LIPIcs, Volume 23, Computer Science Logic 2013 (CSL 2013)
Andrei Bulatov, Victor Dalmau, and Marc Thurley. Descriptive complexity of approximate counting CSPs. In Computer Science Logic 2013 (CSL 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 23, pp. 149-164, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InProceedings{bulatov_et_al:LIPIcs.CSL.2013.149, author = {Bulatov, Andrei and Dalmau, Victor and Thurley, Marc}, title = {{Descriptive complexity of approximate counting CSPs}}, booktitle = {Computer Science Logic 2013 (CSL 2013)}, pages = {149--164}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-60-6}, ISSN = {1868-8969}, year = {2013}, volume = {23}, editor = {Ronchi Della Rocca, Simona}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2013.149}, URN = {urn:nbn:de:0030-drops-41955}, doi = {10.4230/LIPIcs.CSL.2013.149}, annote = {Keywords: Constraint Satisfaction Problems, Approximate Counting, Descriptive Complexity} }
Published in: LIPIcs, Volume 14, 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)
Marc Thurley. An Approximation Algorithm for #k-SAT. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 78-87, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{thurley:LIPIcs.STACS.2012.78, author = {Thurley, Marc}, title = {{An Approximation Algorithm for #k-SAT}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {78--87}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2012.78}, URN = {urn:nbn:de:0030-drops-34400}, doi = {10.4230/LIPIcs.STACS.2012.78}, annote = {Keywords: #k-SAT, approximate counting, exponential algorithms} }
Published in: LIPIcs, Volume 3, 26th International Symposium on Theoretical Aspects of Computer Science (2009)
Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, and Marc Thurley. A Complexity Dichotomy for Partition Functions with Mixed Signs. In 26th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 3, pp. 493-504, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{goldberg_et_al:LIPIcs.STACS.2009.1821, author = {Goldberg, Leslie Ann and Grohe, Martin and Jerrum, Mark and Thurley, Marc}, title = {{A Complexity Dichotomy for Partition Functions with Mixed Signs}}, booktitle = {26th International Symposium on Theoretical Aspects of Computer Science}, pages = {493--504}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-09-5}, ISSN = {1868-8969}, year = {2009}, volume = {3}, editor = {Albers, Susanne and Marion, Jean-Yves}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1821}, URN = {urn:nbn:de:0030-drops-18217}, doi = {10.4230/LIPIcs.STACS.2009.1821}, annote = {Keywords: Computational complexity} }
Feedback for Dagstuhl Publishing