R. O'Donnell, R.A. Servedio, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings., 2003, 3
Joshua A. Grochow, Toniann Pitassi, “Circuit Complexity, Proof Complexity, and Polynomial Identity Testing”, J. ACM, 65, no. 6, 2018, 1
Rahul Santhanam, “Circuit Lower Bounds for Merlin–Arthur Classes”, SIAM J. Comput., 39, no. 3, 2009, 1038
Ronen Shaltiel, “Typically-correct derandomization”, SIGACT News, 41, no. 2, 2010, 57
Siu Man Chan, 2013 IEEE Conference on Computational Complexity, 2013, 133
Алексей Дмитриевич Коршунов, Aleksei Dmitrievich Korshunov, “Монотонные булевы функции”, УМН, 58, no. 5, 2003, 89
Lance Fortnow, “Time–Space Tradeoffs for Satisfiability”, Journal of Computer and System Sciences, 60, no. 2, 2000, 337
Alexis Maciel, Toniann Pitassi, Alan R. Woods, “A New Proof of the Weak Pigeonhole Principle”, Journal of Computer and System Sciences, 64, no. 4, 2002, 843
Joshua A. Grochow, “Unifying Known Lower Bounds via Geometric Complexity Theory”, comput. complex., 24, no. 2, 2015, 393
Ryan Williams, “Some ways of thinking algorithmically about impossibility”, ACM SIGLOG News, 4, no. 3, 2017, 28