SIGN IN
SIGN UP
On isomorphisms and density of NP and other complete sets
Full Text:
PDF
Buy this Article
Authors:
J. Hartmanis
L. Berman
Published in:
· Proceeding
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Pages 30-40
ACM
New York, NY
, USA
©1976
table of contents
doi>
10.1145/800113.803628
1976 Article
Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 28
· Downloads (cumulative): 697
· Citation Count: 3
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
reducibility and completeness
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