Sciweavers

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

11

STOC
2010
ACM

favoriteEmaildiscussreport

219views Algorithms» more STOC 2010»

A Deterministic Single Exponential Time Algorithm for Most Lattice Problems based on Voronoi Cell Computations

14 years 1 months ago

A Deterministic Single Exponential Time Algorithm for Most Lattice Problems based on Voronoi Cell Computations

Download cseweb.ucsd.edu

Daniele Micciancio and Panagiotis Voulgaris

Real-time Traffic

Algorithms | Most Lattice Problems | STOC 2010 | Voronoi Cell Computations |

claim paper

Related Content

» Algorithmics in Exponential Time

» Lower Bounds on Near Neighbor Search via Metric Expansion

» Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons

» Fast incremental proximity search in large graphs

Post Info
More Details (n/a)

Added	01 Mar 2010
Updated	02 Mar 2010
Type	Conference
Year	2010
Where	STOC
Authors	Daniele Micciancio and Panagiotis Voulgaris

Comments (0)