A card from a free library — ask anything, no account, works offline. Every card carries its source.
Hartmanis 1965 — On the computational complexity of algorithms
chain
J. Hartmanis, R. E. Stearns (1965). On the computational complexity of algorithms. Trans. Amer. Math. Soc. 117 (1965) 285–306. DOI 10.1090/S0002-9947-1965-0170805-7. Canonical: https://doi.org/10.1090/S0002-9947-1965-0170805-7. Free copy: https://www.ams.org/journals/tran/1965-117-00/S0002-9947-1965-0170805-7/. License as found: AMS — publisher's copyright; free back-volume access on ams.org — cited. What it gave the chain: time as a resource: the hierarchy of complexity classes.
source
card id
card_chain_hartmanis_stearns_1965
address
WIT.codex.FCT/on-the-computational-complexity-of-algorithms/REF.WITNESSED@j-hartmanis-r-e-stearns
adjoining cards
- builds on → Turing 1936 — On computable numbers, with an application to the Entscheidungsproblem — time as a resource: the hierarchy of complexity classes
- enables → S. A. Cook 1971 — The complexity of theorem-proving procedures — a later work standing on an earlier one
Is this card incomplete? Tell the library — it will call out for more ↗