SIGN IN
SIGN UP
Some optimal inapproximability results
Full Text:
PDF
Buy this Article
Author:
Johan Håstad
Royal Institute of Technology, Sweden
Published in:
· Proceeding
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Pages 1-10
ACM
New York, NY
, USA
©1997
table of contents
ISBN:0-89791-888-6
doi>
10.1145/258533.258536
1997 Article
Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 25
· Downloads (cumulative): 699
· Citation Count: 153
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC '14
Share:
|
Tags:
algorithm design and analysis
algorithms
design
linear approximation
linear programming
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 Guide to Computing Literature
All Tags
Export Formats
Save to Binder