For every constant gamma >= 1, k-Even Set is W[1]-hard to approximate under randomized reductions, and for every p > 1, k-SVP in the l_p norm is W[1]-hard to approximate to some constant factor.
The shortest vector problem in _2 is NP -hard for randomized reductions (extended abstract)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Parameterized Intractability of Even Set and Shortest Vector Problem
For every constant gamma >= 1, k-Even Set is W[1]-hard to approximate under randomized reductions, and for every p > 1, k-SVP in the l_p norm is W[1]-hard to approximate to some constant factor.