Rahul Santhanam, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, 2007, 275
Dmitry Gavinsky, Or Meir, Omri Weinstein, Avi Wigderson, “Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation”, SIAM J. Comput., 46, no. 1, 2017, 114
Rahul Santhanam, “The Complexity of Explicit Constructions”, Theory Comput Syst, 51, no. 3, 2012, 297
Neeraj Kayal, Vineet Nair, Chandan Saha, “Average-case linear matrix factorization and reconstruction of low width algebraic branching programs”, comput. complex., 28, no. 4, 2019, 749
Michael Alekhnovich, “More on Average Case vs Approximation Complexity”, comput. complex., 20, no. 4, 2011, 755
Eric Miles, Emanuele Viola, “Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs”, J. ACM, 62, no. 6, 2015, 1
Allison B. Lewko, Brent Waters, Proceedings of the 16th ACM conference on Computer and communications security, 2009, 112
Harry Buhrman, Lance Fortnow, Rahul Santhanam, 5555, Automata, Languages and Programming, 2009, 195
Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, “The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory”, Journal of Computer and System Sciences, 77, no. 1, 2011, 14
M. Alekhnovich, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings., 2003, 298