{"id": "card_chain_hartmanis_stearns_1965", "kind": "reference", "title": "Hartmanis 1965 — On the computational complexity of algorithms", "body": "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": {"label": "J. Hartmanis, R. E. Stearns (1965), Trans. Amer. Math. Soc. 117 (1965) 285–306", "url": "https://doi.org/10.1090/S0002-9947-1965-0170805-7", "domain": "computer_science", "authority_tier": "reference"}, "shelf": "codex", "box": "chain", "bands": ["chain", "record", "1965", "hartmanis", "computer science"], "subject": "On the computational complexity of algorithms", "connections": [{"to_card_id": "card_chain_turing_1936", "relationship": "builds_on", "evidence": "time as a resource: the hierarchy of complexity classes"}, {"to_card_id": "card_src_mill_cook_1971", "relationship": "enables", "evidence": "a later work standing on an earlier one"}], "author": "engine", "created_at": 0.0, "updated_at": 0.0, "visibility": "public", "lifecycle_stage": "public", "volatility": "permanent", "surface": "secular", "generated": false, "call": "codex.chain", "facets": {"subject": ["1965", "computer science", "hartmanis", "record"]}, "presentation": {"glyph": "•", "kind_label": "chain", "by": "J. Hartmanis, R. E. Stearns (1965), Trans. Amer. Math. Soc. 117 (1965) 285–306", "authority": "reference", "posted": "", "standing": "", "link": {"url": "https://doi.org/10.1090/S0002-9947-1965-0170805-7", "host": "doi.org", "provider": "", "titled": "Hartmanis 1965 — On the computational complexity of algorithms", "waybill_line": "", "reach": "", "embed": ""}}, "neighbors": [{"id": "card_chain_turing_1936", "title": "Turing 1936 — On computable numbers, with an application to the Entscheidungsproblem", "relationship": "builds on", "why": "time as a resource: the hierarchy of complexity classes", "href": "/card/card_chain_turing_1936", "resolved": true}, {"id": "card_src_mill_cook_1971", "title": "S. A. Cook 1971 — The complexity of theorem-proving procedures", "relationship": "enables", "why": "a later work standing on an earlier one", "href": "/card/card_src_mill_cook_1971", "resolved": true}], "house": {"door": "FIND", "kind": "card", "trail": "connections", "seal": "/card/card_chain_hartmanis_stearns_1965", "next_step": {"do": "read the source itself", "door": "FIND", "web": "/reader.html?card=card_chain_hartmanis_stearns_1965"}, "ends": "a verdict or a card · the trail · a seal · one next step"}}