ACM Symposium on Discrete Algorithms, SODA 2016

Article Details
Title: Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus
Article URLs:
Alternative Article URLs:
Authors: Radu Curticapean
  • Simons Institute for the Theory of Computing, Berkeley
  • Institute for Computer Science and Control, Hungarian Academy of Sciences
Dániel Marx
  • Hungarian Academy of Sciences (MTA SZTAKI), Institute for Computer Science and Control
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/soda/CurticapeanM16
Author Comments:

Discuss this paper and its artifacts below