Sivakanth Gopi

CSPs with global modular constraints: algorithms and hardness via polynomial representations