Finding minimal triangulations of convex 3-polytopes is NP-hard

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Alexander Below Institut für Theoretische, Informatik, ETH Zürich
Jesús A. De Loera Dept of Mathematics, Univ. of California-Davis
Jürgen Richter-Gebert Institut für Theoretische, Informatik, ETH Zürich
Published in:
· Proceeding
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Pages 65-66
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©2000
table of contents ISBN:0-89871-453-2
Finding minimal triangulations of convex 3-polytopes is NP-hard 2000 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 6
· Downloads (cumulative): 202
· Citation Count: 8


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