One pebble versus \(\varepsilon\cdot\log n\) bits (Q3000290)
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 5896930
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | One pebble versus \(\varepsilon\cdot\log n\) bits |
scientific article; zbMATH DE number 5896930 |
Statements
One Pebble Versus ϵ · log n Bits (English)
0 references
18 May 2011
0 references
computational complexity
0 references
space-bounded computations
0 references
pebble machines
0 references
input head reversals
0 references
0.8478760123252869
0 references
0.8471578359603882
0 references
0.7999299168586731
0 references
0.7995787262916565
0 references
0.7977694272994995
0 references
