scientific article; zbMATH DE number 1335879
From MaRDI portal
Publication:4258570
zbMath0935.68035MaRDI QIDQ4258570
Publication date: 13 September 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Improving convergence and practicality of slide-type reductions, The projection games conjecture and the hardness of approximation of Super-SAT and related problems, Non-standard approaches to integer programming, A relation of primal--dual lattices and the complexity of shortest lattice vector problem, A note on the non-NP-hardness of approximate lattice problems under general Cook reductions., Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard