OpenAlex
CSPs with global modular constraints: algorithms and hardness via polynomial representations
Work
Year: 2019
Type: article
Abstract: We study the complexity of Boolean constraint satisfaction problems (CSPs) when the assignment must have Hamming weight in some congruence class modulo M, for various choices of the modulus M. Due to ... more
Authors Joshua Brakensiek, Sivakanth Gopi, Venkatesan Guruswami
Institutions Stanford University, Microsoft (United States), Carnegie Mellon University
Cites: 29
Cited by: 4
Related to: 10
FWCI: 0.77
Citation percentile (by year/subfield): 44.53
Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
Funder National Science Foundation
Grant ID CCF-1526092,CAREER award 1451191, CCF-1523816, CCF-1422045, CCF-1526092