On the Approximability of Presidential Type Predicates

07/09/2019
by   Neng Huang, et al.
0

Given a predicate P: {-1, 1}^k →{-1, 1}, let CSP(P) be the set of constraint satisfaction problems whose constraints are of the form P. We say that P is approximable if given a nearly satisfiable instance of CSP(P), there exists a probabilistic polynomial time algorithm that does better than a random assignment. Otherwise, we say that P is approximation resistant. In this paper, we analyze presidential type predicates, which are balanced linear threshold functions where all of the variables except the first variable (the president) have the same weight. We show that almost all presidential-type predicates P are approximable. More precisely, we prove the following result: for any δ_0 > 0, there exists a k_0 such that if k ≥ k_0, δ∈ (δ_0,1 - 2/k], and δk + k - 1 is an odd integer then the presidential-type predicate P(x) = sign(δkx_1 + ∑_i=2^kx_i) is approximable.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/12/2018

On the Approximation Resistance of Balanced Linear Threshold Functions

In this paper, we show that there exists a balanced linear threshold fun...
research
06/11/2018

On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy

In 1991, Papadimitriou and Yannakakis gave a reduction implying the -h...
research
12/24/2022

Triplet Reconstruction and all other Phylogenetic CSPs are Approximation Resistant

We study the natural problem of Triplet Reconstruction (also Rooted Trip...
research
02/09/2020

Optimal polynomial-time compression for Boolean Max CSP

In the Boolean maximum constraint satisfaction problem - Max CSP(Γ) - on...
research
09/17/2018

Best-case and Worst-case Sparsifiability of Boolean CSPs

We continue the investigation of polynomial-time sparsification for NP-c...
research
05/23/2022

Approximating CSPs with Outliers

Constraint satisfaction problems (CSPs) are ubiquitous in theoretical co...
research
04/20/2022

A Ihara-Bass Formula for Non-Boolean Matrices and Strong Refutations of Random CSPs

We define a notion of "non-backtracking" matrix associated to any symmet...

Please sign up or login with your details

Forgot password? Click here to reset