SIGN IN
SIGN UP
Quantifiers and approximation
Full Text:
PDF
Buy this Article
Authors:
A. Panconesi
Department of Computer Science, Cornell University, Ithaca, NY
D. Ranjan
Department of Computer Science, Cornell University, Ithaca, NY
Published in:
· Proceeding
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Pages 446-456
ACM
New York, NY
, USA
©1990
table of contents
ISBN:0-89791-361-2
doi>
10.1145/100216.100275
1990 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 6
· Downloads (cumulative): 249
· Citation Count: 8
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
approximation
complexity measures and classes
languages
theory
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