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]
@article{BencsHR24,
title = {Approximating the chromatic polynomial is as hard as computing it exactly},
author = {Ferenc Bencs and Jeroen Huijben and Guus Regts},
year = {2024},
month = {June},
doi = {10.1007/s00037-023-00247-8},
url = {https://doi.org/10.1007/s00037-023-00247-8},
researchr = {https://researchr.org/publication/BencsHR24},
cites = {0},
citedby = {0},
journal = {Computational Complexity},
volume = {33},
number = {1},
pages = {1},
}