Antonina Kolokolova, The Incomputable, 2017, 143
Hanlin Ren, Rahul Santhanam, Zhikun Wang, 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), 2022, 640
Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama, “Bounded depth circuits with weighted symmetric gates: Satisfiability, lower bounds and compression”, Journal of Computer and System Sciences, 105, 2019, 87
Valentine Kabanets, Jin-Yi Cai, Proceedings of the thirty-second annual ACM symposium on Theory of computing, 2000, 73
V. Kabanets, Proceedings 15th Annual IEEE Conference on Computational Complexity, 2000, 150
Scott Aaronson, “Guest Column: NP-complete problems and physical reality”, SIGACT News, 36, № 1, 2005, 30
Eric Miles, Emanuele Viola, 7417, Advances in Cryptology – CRYPTO 2012, 2012, 68
Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman, “Mining Circuit Lower Bound Proofs for Meta-Algorithms”, comput. complex., 24, № 2, 2015, 333
Benjamin Rossman, Proceedings of the forty-sixth annual ACM symposium on Theory of computing, 2014, 203
Russell Impagliazzo, Valentine Kabanets, Avi Wigderson, “In search of an easy witness: exponential time vs. probabilistic polynomial time”, Journal of Computer and System Sciences, 65, № 4, 2002, 672