Relationships between nondeterministic and deterministic tape complexities (Q2537313): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q55879839, #quickstatements; #temporary_batch_1703701571791 |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Machine-Independent Theory of the Complexity of Recursive Functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5592246 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Relations Between Time and Tape Complexities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Classes of computable functions defined by bounds on computation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Deterministic simulation of non-deterministic turing machines (Detailed Abstract) / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 00:12, 12 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Relationships between nondeterministic and deterministic tape complexities |
scientific article |
Statements
Relationships between nondeterministic and deterministic tape complexities (English)
0 references
1970
0 references
languages, automata, networks
0 references