Citation:
Pyne, Edward, and Salil Vadhan. “Deterministic approximation of random walks via queries in graphs of unbounded size.” Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA '22), 2022, 57-67.
 | SOSA 22.pdf | 0 bytes |
Abstract:
Version History: Preliminary version posted as arXiv:2111.01997 [cs.CC].
Abstract: Forthcoming.