The complexity of on-line simulations between multidimensional turing machines and random access machines (Q4013406)
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 64250
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of on-line simulations between multidimensional turing machines and random access machines |
scientific article; zbMATH DE number 64250 |
Statements
The complexity of on-line simulations between multidimensional turing machines and random access machines (English)
0 references
27 September 1992
0 references
on-line simulations between multidimensional Turing machines and random access machines
0 references
time complexity
0 references
weight-balanced trees
0 references
0 references
0.8327751755714417
0 references
0.8147711753845215
0 references
0.7903348207473755
0 references
0.7867926955223083
0 references
0.7805217504501343
0 references
