default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID"Feasible computations and provable complexity properties."
Juris Hartmanis (1989)
- Juris Hartmanis:
Feasible computations and provable complexity properties. CBMS-NSF regional conference series in applied mathematics 30, SIAM 1989, ISBN 978-0-89871-027-4, pp. 1-62
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2019-07-12 14:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
