Pseudorandom walks on regular digraphs and the RL vs. L problem

15 years 8 months ago

We revisit the general RL vs. L question, obtaining the following results.

Omer Reingold, Luca Trevisan, Salil P. Vadhan

Algorithms | General Rl | STOC 2006 |

claim paper

Added	14 Jun 2010
Updated	14 Jun 2010
Type	Conference
Year	2006
Where	STOC
Authors	Omer Reingold, Luca Trevisan, Salil P. Vadhan

Comments (0)