CSPs with global modular constraints: algorithms and hardness via polynomial representations
Published in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
Journal version: SIAM Journal of Computing, 2022
Recommended citation: Joshua Brakensiek, Sivakanth Gopi, Venkatesan Guruswami, "CSPs with global modular constraints: algorithms and hardness via polynomial representations." Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019.
Download Paper