Pseudorandom walks on regular digraphs and the RL vs. L problem (Q2931408)
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: Pseudorandom walks on regular digraphs and the RL vs. L problem |
scientific article; zbMATH DE number 6373918
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Pseudorandom walks on regular digraphs and the RL vs. L problem |
scientific article; zbMATH DE number 6373918 |
Statements
Pseudorandom walks on regular digraphs and the RL vs. L problem (English)
0 references
25 November 2014
0 references
derandomization
0 references
expander graphs
0 references
mixing time
0 references
space-bounded computation
0 references
universal traversal sequence
0 references
zig-zag product
0 references
0.8027248382568359
0 references
0.7938487529754639
0 references
0.7916266322135925
0 references
0.7881942987442017
0 references
0.7880726456642151
0 references
