Sciweavers

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

27

JCSS
2000

favoriteEmaildiscussreport

37views more JCSS 2000»

On the Limits of Nonapproximability of Lattice Problems

13 years 10 months ago

On the Limits of Nonapproximability of Lattice Problems

Download groups.csail.mit.edu

Oded Goldreich, Shafi Goldwasser

Real-time Traffic

JCSS 2000 |

claim paper

Related Content

» On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lat...

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

» Limits on the Hardness of Lattice Problems in lp Norms

» Lattice model refinement of protein structures

» An Explicit ClosedForm Solution to the LimitedAngle Discrete Tomography Problem for Finite...

» Partial Key Exposure Attack on RSA Improvements for Limited Lattice Dimensions

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

» Parallel computation of adaptive lattice filters

» The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2000
Where	JCSS
Authors	Oded Goldreich, Shafi Goldwasser

Comments (0)