Counting \(4 \times 4\) matrix partitions of graphs (Q313799)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6626385
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting \(4 \times 4\) matrix partitions of graphs |
scientific article; zbMATH DE number 6626385 |
Statements
Counting \(4 \times 4\) matrix partitions of graphs (English)
0 references
12 September 2016
0 references
matrix partitions of graphs
0 references
complexity of counting
0 references
complexity dichotomy
0 references
\(\#\mathrm{P}\)-completeness
0 references
0 references
0.8709332346916199
0 references
0.8629873394966125
0 references
0.787832498550415
0 references
0.7740855813026428
0 references
0.7721795439720154
0 references
