J. Buresh-Oppenheim, R. Santhanam, 21st Annual IEEE Conference on Computational Complexity (CCC'06), 2006, 73
Sanjeev Arora, David Steurer, Avi Wigderson, 5555, Automata, Languages and Programming, 2009, 119
Nir Bitansky, Ran Canetti, Alessandro Chiesa, Eran Tromer, Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, 2012, 326
Samuel R. Buss, Ryan Williams, 2012 IEEE 27th Conference on Computational Complexity, 2012, 181
Juraj Hromkovič, Georg Schnitger, 5257, Developments in Language Theory, 2008, 34
Valentine Kabanets, “Almost k-wise independence and hard Boolean functions”, Theoretical Computer Science, 297, no. 1-3, 2003, 281
Emanuele Viola, “Constant-Error Pseudorandomness Proofs from Hardness Require Majority”, ACM Trans. Comput. Theory, 11, no. 4, 2019, 1
Lijie Chen, Roei Tell, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019, 34
Leonid Libkin, Limsoon Wong, “Lower bounds for invariant queries in logics with counting”, Theoretical Computer Science, 288, no. 1, 2002, 153
Kazuyuki Amano, Akira Maruoka, “The Potential of the Approximation Method”, SIAM J. Comput., 33, no. 2, 2004, 433