On the Structure of Polynomial Time Reducibility

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: Richard E. Ladner Department of Computer Science, University of Washington, Seattle, WA
Published in:
· Journal
Journal of the ACM (JACM) JACM Homepage archive
Volume 22 Issue 1, Jan. 1975
Pages 155-171
ACM New York, NY, USA
table of contents doi>10.1145/321864.321877
On the Structure of Polynomial Time Reducibility Published by ACM 1975 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 37
· Downloads (12 Months): 274
· Downloads (cumulative): 3,357
· Citation Count: 107


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


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