Storage requirements for deterministic polynomial time recognizable languages (Q1230508): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1096389 |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Stephen A. Cook / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Comparing complexity classes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An observation on time-storage trade off / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4153609 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5180413 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4185781 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complete Register Allocation Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Characterization of flowchartable recursions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recognition and parsing of context-free languages in time n3 / rank | |||
Normal rank |
Latest revision as of 19:43, 12 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Storage requirements for deterministic polynomial time recognizable languages |
scientific article |
Statements
Storage requirements for deterministic polynomial time recognizable languages (English)
0 references
1976
0 references