Review: Juris Hartmanis, Computational Complexity Theory [Book Review]
Journal of Symbolic Logic 56 (1):335-336 (1991)
| Abstract | This article has no associated abstract. (fix it) |
| Keywords | No keywords specified (fix it) |
| Categories | (categorize this paper) |
| DOI | 10.2307/2274929 |
| Options |
Mark as duplicate
Export citation
Request removal from index
|
Download options
PhilArchive copy
Upload a copy of this paper Check publisher's policy Papers currently archived: 57,077
External links
- From the Publisher via CrossRef (no proxy)
- projecteuclid.org
(no proxy) - projecteuclid.org [2] (no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
- Sign in / register and customize your OpenURL resolver..
- Configure custom resolver
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Analytics
Added to PP index
2013-11-03
Total views
8 ( #946,592 of 2,411,348 )
Recent downloads (6 months)
1 ( #538,938 of 2,411,348 )
2013-11-03
Total views
8 ( #946,592 of 2,411,348 )
Recent downloads (6 months)
1 ( #538,938 of 2,411,348 )
How can I increase my downloads?
Downloads
