Radu Curticapean, Dániel Marx. Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus. In Robert Krauthgamer, editor, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016. pages 1650-1669, SIAM, 2016. [doi]
@inproceedings{CurticapeanM16,
title = {Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus},
author = {Radu Curticapean and Dániel Marx},
year = {2016},
doi = {10.1137/1.9781611974331.ch113},
url = {http://dx.doi.org/10.1137/1.9781611974331.ch113},
researchr = {https://researchr.org/publication/CurticapeanM16},
cites = {0},
citedby = {0},
pages = {1650-1669},
booktitle = {Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016},
editor = {Robert Krauthgamer},
publisher = {SIAM},
isbn = {978-1-61197-433-1},
}