Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus.
Radu CurticapeanDániel MarxPublished in: SODA (2016)
Keyphrases
- bounded treewidth
- lower bound
- np complete
- upper bound
- monadic datalog
- np hard
- decision problems
- highly parallelizable
- conjunctive queries
- boolean functions
- relational learning
- worst case
- objective function
- optimal solution
- constraint satisfaction problems
- fixed parameter tractable
- database
- model counting
- graph theoretic
- sufficient conditions
- data management
- bounded degree
- probability distribution
- decision making