On the relationship between deterministic time and deterministic reversal (Q1209341): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(93)90016-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2152770242 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The difference between one tape and two tapes: With respect to reversal complexity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Reversal Complexity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The reduction of tape reversals for off-line one-tape Turing machines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Tape-reversal bounded Turing machine computations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Time Versus Space / rank | |||
Normal rank | |||
Latest revision as of 15:35, 17 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the relationship between deterministic time and deterministic reversal |
scientific article |
Statements
On the relationship between deterministic time and deterministic reversal (English)
0 references
16 May 1993
0 references
computational complexity
0 references
time complexity
0 references
deterministic Turing machines
0 references
