An Algorithm for Convex Polytopes

doi:10.1145/321556.321564

An Algorithm for Convex Polytopes

Full Text:

PDF

Buy this Article

Authors:	Donald R. Chand	Advanced Computing Techniques Department, Lockheed-Georgia Company, Marietta, Georgia
	Sham S. Kapur	Research Laboratory, Lockheed-Georgia Company, Marietta, Georgia

Published in:

· Journal

Journal of the ACM (JACM) JACM Homepage archive

Volume 17 Issue 1, Jan. 1970
Pages 78-86
ACM New York, NY, USA
table of contents doi>10.1145/321556.321564

	1970 Article
Bibliometrics
· Downloads (6 Weeks): 9 · Downloads (12 Months): 84 · Downloads (cumulative): 911 · Citation Count: 32

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: algorithms computations on discrete structures general measurement performance theory verification

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

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