A Lower Bound to Finding Convex Hulls

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: Andrew Chi-Chih Yao Computer Science Department, Stanford University, Stanford, California
Published in:
· Journal
Journal of the ACM (JACM) JACM Homepage archive
Volume 28 Issue 4, Oct. 1981
Pages 780-787
ACM New York, NY, USA
table of contents doi>10.1145/322276.322289
A Lower Bound to Finding Convex Hulls Published by ACM 1981 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 6
· Downloads (12 Months): 46
· Downloads (cumulative): 799
· Citation Count: 15


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 © 2013 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