Random walks on some basic classes of digraphs (Q2851903)
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 6213541
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Random walks on some basic classes of digraphs |
scientific article; zbMATH DE number 6213541 |
Statements
Random Walks on Some Basic Classes of Digraphs (English)
0 references
4 October 2013
0 references
space-bounded complexity classes
0 references
random walks
0 references
digraph search
0 references
reachability
0 references
strong connectivity
0 references
symmetric computation
0 references
L
0 references
RL
0 references
NL
0 references
BPL
0 references
0.8027248382568359
0 references
0.7837194204330444
0 references
0.7572076320648193
0 references
0.7479960322380066
0 references
0.7477710247039795
0 references
