Computational complexity of counting problems on 3-regular planar graphs (Q2382289)
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: Computational complexity of counting problems on 3-regular planar graphs |
scientific article; zbMATH DE number 5196814
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity of counting problems on 3-regular planar graphs |
scientific article; zbMATH DE number 5196814 |
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
0.8811739087104797
0 references
0.8788983821868896
0 references
0.8468872308731079
0 references
0.8401299715042114
0 references
0.8337576389312744
0 references
