Inapproximability of counting hypergraph colourings

DOI10.1145/3558554MaRDI QIDQ7023434zbMATH OpenFDO

Authors Andreas Galanis, Heng Guo, Jiaheng Wang

Publication date 21 February 2025

Published in ACM Transactions on Computation Theory (Search for Journal in Brave)

zbMATH Keywords

colouringapproximate countinghypergraphcounting complexityLovász local lemma

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Computational aspects of satisfiability (68R07)

This page was built for publication: Inapproximability of counting hypergraph colourings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7023434)