Assuming worst-case lattice hardness, no polynomial-time algorithm can solve SBP at kappa close to 1/sqrt(x) or NPP at kappa close to 2^{-log^3 m}.
Generating hard instances of lattice problems (extended abstract)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
math.ST 1years
2025 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Symmetric Perceptrons, Number Partitioning and Lattices
Assuming worst-case lattice hardness, no polynomial-time algorithm can solve SBP at kappa close to 1/sqrt(x) or NPP at kappa close to 2^{-log^3 m}.