Relationships between nondeterministic and deterministic tape complexities (Q2537313): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: DBLP publication ID (P1635): journals/jcss/Savitch70, #quickstatements; #temporary_batch_1739204820419 |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q55879839 / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / 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 | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/jcss/Savitch70 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 17:28, 10 February 2025
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
