Efficient simulations of simple models of parallel computation by time- bounded ATMs and space-bounded TMs (Q1124332)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient simulations of simple models of parallel computation by time- bounded ATMs and space-bounded TMs |
scientific article; zbMATH DE number 4112005
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient simulations of simple models of parallel computation by time- bounded ATMs and space-bounded TMs |
scientific article; zbMATH DE number 4112005 |
Statements
Efficient simulations of simple models of parallel computation by time- bounded ATMs and space-bounded TMs (English)
0 references
1989
0 references
complexity of languages
0 references
arrays of finite-state machines
0 references
tree arrays
0 references
triangular arrays
0 references
k-dimensional mesh-connected arrays
0 references
time-bounded ATM
0 references
space-bounded TM
0 references
interconnected networks
0 references
0 references
0.86387223
0 references
0.86047125
0 references
0.8547499
0 references
