Approximating the chromatic polynomial is as hard as computing it exactly (Q6121107): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:25, 10 July 2024
scientific article; zbMATH DE number 7809280
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the chromatic polynomial is as hard as computing it exactly |
scientific article; zbMATH DE number 7809280 |
Statements
Approximating the chromatic polynomial is as hard as computing it exactly (English)
0 references
26 February 2024
0 references
\#P-hardness
0 references
approximate counting
0 references
chromatic polynomial
0 references
planar graphs
0 references
Tutte polynomial
0 references
