We show simple constant-round interactive proof systems for problems capturing the approximability, to within a factor ofn, of optimization problems in integer lattices, specifically, the closest vector problem (CVP) and the shortest vector problem (SVP). These interactive proofs are for the coNP di
✦ LIBER ✦
Limits on the Hardness of Lattice Problems inℓpNorms
✍ Scribed by Chris Peikert
- Publisher
- Springer
- Year
- 2008
- Tongue
- English
- Weight
- 576 KB
- Volume
- 17
- Category
- Article
- ISSN
- 1016-3328
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
On the Limits of Nonapproximability of L
✍
Oded Goldreich; Shafi Goldwasser
📂
Article
📅
2000
🏛
Elsevier Science
🌐
English
⚖ 221 KB
On the hardness of range assignment prob
✍
Bernhard Fuchs
📂
Article
📅
2008
🏛
John Wiley and Sons
🌐
English
⚖ 769 KB
The Hardness of Approximating Spanner Pr
✍
Michael Elkin; David Peleg
📂
Article
📅
2007
🏛
Springer
🌐
English
⚖ 366 KB
Critical phenomena of the hard-sphere la
✍
Atsushi Yamagata
📂
Article
📅
1995
🏛
Elsevier Science
🌐
English
⚖ 245 KB
We study the critical phenomena of the hard-sphere lattice gas on the simple cubic lattice with nearest neighbour exclusion by the Monte Carlo method. We get the critical exponents fl/~, = 0.313(9) and y/~, = 2.37(2), where fl is the critical exponent for the staggered density, Y for the staggered c
On the NP-hardness of edge-deletion and
✍
Toshimasa Watanabe; Tadashi Ae; Akira Nakamura
📂
Article
📅
1983
🏛
Elsevier Science
🌐
English
⚖ 1015 KB
Measure on the inductive limit of projec
✍
M. S. Matvejchuk
📂
Article
📅
1993
🏛
Springer
🌐
English
⚖ 208 KB