Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > MOD GATES, COMPOSITE MODULI, EXPONENTIAL SUMS :
Reports tagged with Mod gates, composite moduli, exponential sums :
TR11-048 | 10th April 2011
We consider a system of linear constraints over any finite Abelian group $G$ of the following form: $\ell_i(x_1,\ldots,x_n) \equiv \ell_{i,1}x_1+\cdots+\ell_{i,n}x_n \in A_i$ for $i=1,\ldots,t$ and each $A_i \subset G$, $\ell_{i,j}$ is an element of $G$ and $x_i$'s are Boolean variables. Our main result shows that the subset of the Boolean ... more >>>