Complexity classification of counting graph homomorphisms modulo a prime number

DOI10.1145/3519935.3520075arXiv2106.04086OpenAlexW3170248899WikidataQ130966994 ScholiaQ130966994MaRDI QIDQ6083556

Andrei A. Bulatov, Amirhossein Kazeminia

Publication date: 8 December 2023

Published in: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.04086

zbMATH Keywords

graph homomorphismscomplexity theorydichotomy theoremmodular counting

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: Complexity classification of counting graph homomorphisms modulo a prime number