Computational complexity of multitape Turing machines and random access machines (Q1249434): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4091421 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Languages Accepted in Polynomial Time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Time- and tape-bounded Turing acceptors and AFLs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5670175 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Time bounded random access machines / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5590814 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Counter machines and counter languages / rank | |||
Normal rank |
Latest revision as of 00:08, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computational complexity of multitape Turing machines and random access machines |
scientific article |
Statements
Computational complexity of multitape Turing machines and random access machines (English)
0 references
1977
0 references