Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference35 articles.
1. Scott Aaronson, Bariş Aydinlioǧlu, Harry Buhrman, John Hitchcock & Dieter van Melkebeek (2010). A Note on Exponential Circuit Lower Bounds from Derandomizing Arthur-Merlin Games. Technical Report TR10-174, Electronic Colloquium on Computational Complexity.
2. Benny Applebaum (2014). Cryptography in Constant Parallel Time. Information Security and Cryptography. Springer, 1–185.
3. Vikraman Arvind, Johannes Köbler (2001) On Pseudorandomness and Resource-Bounded Measure. Theoretical Computer Science 255(1-2): 205–221
4. Bariş Aydinlioǧlu, Dan Gutfreund, John Hitchcock, Akinori Kawachi (2011) Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds. Computational Complexity 20(2): 329–366
5. Nayantara Bhatnagar, Andrej Bogdanov & Elchanan Mossel (2011). The Computational Complexity of Estimating MCMC Convergence Time. In Proceedings of the 15th International Workshop on Randomization and Computation, 424–435.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献