Sciweavers

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

10

STACS
2004
Springer

favoriteEmaildiscussreport

110views Theoretical Computer Science» more STACS 2004»

Lattices with Many Cycles Are Dense

13 years 10 months ago

Lattices with Many Cycles Are Dense

Download www.nada.kth.se

Abstract We give a method for approximating any n-dimensional lattice with a lattice Λ whose factor group Zn /Λ has n − 1 cycles of equal length with arbitrary precision. We also show that a direct consequence of this is that the Shortest Vector Problem and the Closest Vector Problem cannot be easier for this type of lattices than for general lattices.

Mårten Trolin

Real-time Traffic

Closest Vector Problem | Shortest Vector Problem | STACS 2004 | Theoretical Computer Science | Vector Problem |

claim paper

Related Content

» The Shortest Vector Problem in Lattices with Many Cycles

» Adjugate pairs of sparse arrays for sampling two dimensional signals

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

» An experimental evaluation of tiling and shackling for memory hierarchy management

» RunTime Code Generation as a Central System Service

» A sumoverpaths extension of edit distances accounting for all sequence alignments

» A General Approximation Technique for Constrained Forest Problems

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	STACS
Authors	Mårten Trolin

Comments (0)