Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus (Q4575697)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus |
scientific article; zbMATH DE number 6903990
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus |
scientific article; zbMATH DE number 6903990 |
Statements
Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus (English)
0 references
16 July 2018
0 references
