Approximating the chromatic polynomial is as hard as computing it exactly

Ferenc Bencs, Jeroen Huijben, Guus Regts. Approximating the chromatic polynomial is as hard as computing it exactly. Computational Complexity, 33(1):1, June 2024. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.