Author:
Mandal Debasis,Pavan A.,Vinodchandran N. V.
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Adleman, L.M.: Two theorems on random polynomial time. In: Proceedings of the 19th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 75–83 (1978)
2. Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press, Cambridge (2009)
3. Borodin, A., Cook, S., Pippenger, N.: Parallel computation for well-endowed rings and space-bounded probabilistic machines. Inf. Control 58(1–3), 113–136 (1983)
4. Chung, K.M., Reingold, O., Vadhan, S.: S-T connectivity on digraphs with a known stationary distribution. ACM Trans. Algorithms 7(3), 30 (2011)
5. David, M., Nguyen, P., Papakonstantinou, P.A., Sidiropoulos, A.: Computationally Limited Randomness. In: Proceedings of the Innovations in Theoretical Computer Science (ITCS) (2011)