Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

29

CC
2008
Springer

favoriteEmaildiscussreport

121views System Software» more CC 2008»

Limits on the Hardness of Lattice Problems in lp Norms

13 years 11 months ago

Limits on the Hardness of Lattice Problems in lp Norms

Download www.cc.gatech.edu

Chris Peikert

Real-time Traffic

CC 2008 | System Software |

claim paper

Related Content

» Lattice problems and norm embeddings

» Hardness of the Covering Radius Problem on Lattices

» Hardness of Approximating the Shortest Vector Problem in Lattices

» Counting lattice vectors

» The Shortest Vector in a Lattice is Hard to Approximate to Within Some Constant

» The LeakageResilience Limit of a Computational Problem Is Equal to Its Unpredictability En...

» Efficient latticebased signature scheme

» Lattice sensor networks capacity limits optimal routing and robustness to failures

» Lattice model refinement of protein structures

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CC
Authors	Chris Peikert

Comments (0)