Combinatorial Lower Bound Arguments for Deterministic and Nondeterministic Turing Machines (Q3748273)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3983150
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combinatorial Lower Bound Arguments for Deterministic and Nondeterministic Turing Machines |
scientific article; zbMATH DE number 3983150 |
Statements
1985
0 references
palindrome
0 references
time bounds
0 references
deterministic Turing machine
0 references
nondeterministic Turing machine
0 references
Combinatorial Lower Bound Arguments for Deterministic and Nondeterministic Turing Machines (English)
0 references
0 references
0.8068060874938965
0 references
0.7735154628753662
0 references
