Author:
Dixon Peter,Gayen Sutanu,Pavan A.,Vinodchandran N. V.
Publisher
Springer International Publishing
Reference25 articles.
1. Aaronson, S.: Impossibility of succinct quantum proofs for collision-freeness. Quant. Inf. Comput. 12(1–2), 21–28 (2012)
2. Aaronson, S., Aydinlioglu, B., Buhrman, H., Hitchcock, J.M., van Melkebeek, D.: A note on exponential circuit lower bounds from derandomizing Arthur-Merlin games. Electron. Colloq. Comput. Complex. (ECCC) 17, 174 (2010)
3. Aiello, W., Hastad, J.: Statistical zero-knowledge languages can be recognized in two rounds. J. Comput. Syst. Sci. 42(3), 327–345 (1991)
4. Arora, S., Barak, B.: Computational Complexity - A Modern Approach. Cambridge University Press, Cambridge (2009)
5. Aydinlioglu, B., Gutfreund, D., Hitchcock, J.M., Kawachi, A.: Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds. Comput. Complex. 20(2), 329–366 (2011)