SIGN IN
SIGN UP
Combinatorial complexity of the central curve
Full Text:
PDF
Buy this Article
Authors:
Peter A. Beling
Department of Systems Engineering, University of Virginia, Charlottesville, VA
Sushil Verma
Department of Industrial Engineering and Systems Engineering, University of Southern California, Los Angeles, CA
Published in:
· Proceeding
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Pages 250-255
ACM
New York, NY
, USA
©1997
table of contents
ISBN:0-89791-888-6
doi>
10.1145/258533.258598
1997 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 6
· Downloads (cumulative): 174
· Citation Count: 0
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC'13
Share:
|
Tags:
algorithms
computations on discrete structures
computations on matrices
design
general
geometrical problems and computations
linear programming
performance
probabilistic computation
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 Guide to Computing Literature
All Tags
Export Formats
Save to Binder