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

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 the known classification of tractable Boolean CSPs, this mainly reduces to the study of three cases: 2-SAT, HORN-SAT, and LIN-2 (linear equations mod 2). We classify the moduli M for which these respective problems are polynomial time solvable, and when they are not (assuming the ETH). Our study reveals that this modular constraint lends a surprising richness to these classic, well-studied problems, with interesting broader connections to complexity theory and coding theory. The HORN-SAT case is connected to the covering complexity of polynomials representing the NAND function mod M. The LIN-2 case is tied to the sparsity of polynomials representing the OR function mod M, which in turn has connections to modular weight distribution properties of linear codes and locally decodable codes. In both cases, the analysis of our algorithm as well as the hardness reduction rely on these polynomial representations, highlighting an interesting algebraic common ground between hard cases for our algorithms and the gadgets which show hardness. These new complexity measures of polynomial representations merit further study. The inspiration for our study comes from a recent work by N'agele, Sudakov, and Zenklusen on submodular minimization with a global congruence constraint. Our algorithm for HORN-SAT has strong similarities to their algorithm, and in particular identical kind of set systems arise in both cases. Our connection to polynomial representations leads to a simpler analysis of such set systems, and also sheds light on (but does not resolve) the complexity of submodular minimization with a congruency requirement modulo a composite M.

[1]  Venkatesan Guruswami,et al.  New Hardness Results for Graph and Hypergraph Colorings , 2016, CCC.

[2]  Russell Impagliazzo,et al.  Which Problems Have Strongly Exponential Complexity? , 2001, J. Comput. Syst. Sci..

[3]  Peter Jeavons,et al.  Classifying the Complexity of Constraints Using Finite Algebras , 2005, SIAM J. Comput..

[4]  Henning Schnoor,et al.  Nonuniform Boolean constraint satisfaction problems with cardinality constraint , 2010, TOCL.

[5]  Dániel Marx,et al.  The Complexity of Global Cardinality Constraints , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[6]  Gábor Tardos,et al.  A lower bound on the mod 6 degree of the OR function , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

[7]  Ran Raz,et al.  Two Query PCP with Sub-Constant Error , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[8]  Phokion G. Kolaitis,et al.  Structure identification of Boolean relations and plain bases for co-clones , 2008, J. Comput. Syst. Sci..

[9]  Avi Wigderson,et al.  Linear Systems over Composite Moduli , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[10]  Klim Efremenko,et al.  3-Query Locally Decodable Codes of Subexponential Length , 2008 .

[11]  Andrei A. Bulatov,et al.  A dichotomy theorem for constraint satisfaction problems on a 3-element set , 2006, JACM.

[12]  Venkatesan Guruswami,et al.  Complexity of Approximating CSP with Balance / Hard Constraints , 2015, Theory of Computing Systems.

[13]  Libor Barto,et al.  Polymorphisms, and How to Use Them , 2017, The Constraint Satisfaction Problem.

[14]  Russell Impagliazzo,et al.  On the Complexity of k-SAT , 2001, J. Comput. Syst. Sci..

[15]  Vince Grolmusz,et al.  Superpolynomial Size Set-systems with Restricted Intersections mod 6 and Explicit Ramsey Graphs , 2000, Comb..

[16]  Sergey Yekhanin Towards 3-query locally decodable codes of subexponential length , 2007, STOC '07.

[17]  M. Krom The Decision Problem for a Class of First‐Order Formulas in Which all Disjunctions are Binary , 1967 .

[18]  Hubie Chen,et al.  A rendezvous of logic, complexity, and algebra , 2009, CSUR.

[19]  Andrei A. Bulatov,et al.  A Dichotomy Theorem for Nonuniform CSPs , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[20]  David A. Mix Barrington,et al.  Representing Boolean functions as polynomials modulo composite numbers , 1992, STOC '92.

[21]  Parikshit Gopalan,et al.  A note on Efremenko's Locally Decodable Codes , 2009, Electron. Colloquium Comput. Complex..

[22]  Rico Zenklusen,et al.  A strongly polynomial algorithm for bimodular integer linear programming , 2017, STOC.

[23]  Pavel Pudlák,et al.  Lower bounds for circuits with MOD_m gates , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[24]  Zeev Dvir,et al.  Matching Vector Codes , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[25]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[26]  Jonathan Katz,et al.  On the efficiency of local decoding procedures for error-correcting codes , 2000, STOC '00.

[27]  Dmitriy Zhuk,et al.  A Proof of CSP Dichotomy Conjecture , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[28]  Peter Jeavons,et al.  On the Algebraic Structure of Combinatorial Problems , 1998, Theor. Comput. Sci..

[29]  Neil Immerman,et al.  The complexity of satisfiability problems: Refining Schaefer's theorem , 2009, J. Comput. Syst. Sci..

[30]  Tomás Feder,et al.  The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..

[31]  Zeev Dvir,et al.  2-Server PIR with Subpolynomial Communication , 2016, J. ACM.

[32]  Avishay Tal,et al.  Two Structural Results for Low Degree Polynomials and Applications , 2014, Electron. Colloquium Comput. Complex..

[33]  Benny Sudakov,et al.  Submodular Minimization Under Congruency Constraints , 2017, Combinatorica.

[34]  Parikshit Gopalan Constructing Ramsey graphs from Boolean function representations , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).

[35]  Emil L. Post The two-valued iterative systems of mathematical logic , 1942 .

[36]  Vinod Vaikuntanathan,et al.  Breaking the circuit-size barrier in secret sharing , 2018, IACR Cryptol. ePrint Arch..

[37]  Shachar Lovett,et al.  New bounds for matching vector families , 2013, STOC '13.