Microsoft Research
Microsoft Translator |
Pseudorandom walks on regular digraphs and the RL vs. L problem

Omer Reingold, Luca Trevisan, and Salil P. Vadhan
2006

In  STOC

Publisher  ACM

Details

TypeInproceedings
Pages457-466
ISBN1-59593-134-1
Share
Share this page on Facebook
Share this page on Twitter
Share this page on LinkedIn
E-mail this page
RSS feeds
> Publications > Pseudorandom walks on regular digraphs and the RL vs. L problem