On the Approximation Resistance of Balanced Linear Threshold Functions
Computational Complexity
2018-12-14 v2
Abstract
In this paper, we show that there exists a balanced linear threshold function (LTF) which is unique games hard to approximate, refuting a conjecture of Austrin, Benabbas, and Magen. We also show that the almost monarchy predicate on k variables is approximable for sufficiently large k.
Cite
@article{arxiv.1807.04421,
title = {On the Approximation Resistance of Balanced Linear Threshold Functions},
author = {Aaron Potechin},
journal= {arXiv preprint arXiv:1807.04421},
year = {2018}
}