A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
The Projection Games Conjecture and the Hardness of Approximation of SSAT and related problems
[article]
2019
arXiv
pre-print
The Super-SAT or SSAT problem was introduced by Dinur, Kindler, Raz and Safra[2002,2003] to prove the NP-hardness of approximation of two popular lattice problems - Shortest Vector Problem (SVP) and Closest Vector Problem (CVP). They conjectured that SSAT is NP-hard to approximate to within factor n^c for some constant c>0, where n is the size of the SSAT instance. In this paper we prove this conjecture assuming the Projection Games Conjecture (PGC), given by Moshkovitz[2012]. This implies
arXiv:1907.05548v2
fatcat:d4kh6fqsr5eglai333xy2uiauq