Infinite vs. finite size-bounded randomized computations (Q2637645)
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 6257465
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Infinite vs. finite size-bounded randomized computations |
scientific article; zbMATH DE number 6257465 |
Statements
Infinite vs. finite size-bounded randomized computations (English)
0 references
13 February 2014
0 references
probabilistic computations
0 references
Las Vegas randomization
0 references
time complexity
0 references
size complexity
0 references
rotating finite automata
0 references
sweeping finite automata
0 references
0 references
0.7872504591941833
0 references
0.7818524241447449
0 references
0.7818524241447449
0 references
