Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Radu Curticapean' in GoogleThis author has not been identified. Look up 'Dániel Marx' in Google

runs on WebDSL