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]

Authors

Ferenc Bencs

This author has not been identified. Look up 'Ferenc Bencs' in Google

Jeroen Huijben

This author has not been identified. Look up 'Jeroen Huijben' in Google

Guus Regts

This author has not been identified. Look up 'Guus Regts' in Google