ACM DL

SIGN IN   SIGN UP

 
ACM Home Page ACM Digital Library Home Page

A sieve algorithm for the shortest lattice vector problem

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Miklós Ajtai IBM Almaden Research Center, 650 Harry Road, San Jose, CA
Ravi Kumar IBM Almaden Research Center, 650 Harry Road, San Jose, CA
D. Sivakumar IBM Almaden Research Center, 650 Harry Road, San Jose, CA
Published in:
· Proceeding
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
ACM New York, NY, USA ©2001
table of contents ISBN:1-58113-349-9 doi>10.1145/380752.380857
A sieve algorithm for the shortest lattice vector problem Published by ACM 2001 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 17
· Downloads (12 Months): 70
· Citation Count: 73


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder