Computational complexity of counting problems on 3-regular planar graphs (Q2382289): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2007.05.023 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2007.05.023 / rank | |||
Normal rank | |||
Latest revision as of 07:39, 18 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational complexity of counting problems on 3-regular planar graphs |
scientific article |
Statements
Computational complexity of counting problems on 3-regular planar graphs (English)
0 references
28 September 2007
0 references
{\#}P-completeness
0 references
holographic reduction
0 references
vertex cover
0 references
matching
0 references
0 references
0 references
0 references
