A polynomial time algorithm is obtained that achieves a $(k/2^k)-approximation, improving on the previous best guarantee of $0.626612\; k/2^k$, and is an extension of a recently established Gaussian comparison inequality used to resolve the Weak Simplex Conjecture in coding theory.
Abstract
Consider the problem of maximizing the number of satisfied constraints of an arbitrary boolean constraint satisfaction problem with arity $k$. We obtain a polynomial time algorithm that achieves a $(k/2^k)$-approximation, improving on the previous best guarantee of $0.626612\; k/2^k$, due to Makarychev and Makarychev (arXiv:1206.3603). Assuming the Unique Games Conjecture, De and Mossel (arXiv:1202.5258) showed that achieving an approximation ratio better than $(k+1)/2^k$ for odd $k$ and $(k+2)/2^k$ for even $k$, is NP-hard. The main technical ingredient is an extension of a recently established Gaussian comparison inequality, used to resolve the Weak Simplex Conjecture in coding theory (arXiv:2607.14087).
Alternative parameterizations of the k-core problem are investigated to identify conditions under which it can be placed into sub-polynomial complexity classes, and the boundary of parallel tractability for the k-core problem is explored.
It is shown that the approximation algorithm for Boolean Max $k$-CSP yields a $(1-o_k(1)/2^k$ approximation, as conjectured in [Makarychev and Makarychev 2017], which improves the previous guarantee of $(0.626612-o_k(1)/2^k$ and asymptotically matches the known hardness results.
The Boolean connectivity problem asks whether the set of satisfying assignments of a given Boolean formula forms a connected subgraph in the $n$-dimensional hypercube. This problem is known to be $\mathsf{coNP}$-complete, even when restricted to $k$-Horn formulas for $k \geq 3$, as shown by Makino, Tamaki, and Yamamoto...
Takashi Horiyama, Shoon Mineyoshi, Yuto Okura et al.· 0 citations
This work gives a deterministic $O(n^2)$-time algorithm for ring verification and obtains a deterministic $O(n^2)$-time algorithm for field verification, resolving the deterministic complexity of this problem.
The present work builds on the differential-equation method, itself a limiting form of the auxiliary-receiver approach in network information theory using a continuum of degraded receivers, and gives a computer-assisted proof of the Courtade--Kumar conjecture.
Zi-Jie Chen, Amin Gohari, Adel Javanmard et al.· 1 citation
It is demonstrated how to compute the largest value of $\alpha$ for which a committee still fails the axiom using this mincut formulation, and a direct mincut formulation of the problem on a bipartite graph is given.
Drew Springham· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
