Shuichi Hirahara, Zhenjian Lu, Igor C. Oliveira, 15364, Theory of Cryptography, 2025, 253
Daniel Loscos, Narciso Marti-Oliet, Ismael Rodriguez, Jorge Villarrubia, 2024 IEEE International Conference on Systems, Man, and Cybernetics (SMC), 2024, 5230
Suguru Tamaki, Algorithmic Foundations for Social Advancement, 2025, 307
Venkatesan Guruswami, Xin Lyu, Xiuhan Wang, “Range Avoidance for Low-Depth Circuits and Connections to Pseudorandomness”, ACM Trans. Comput. Theory, 2025, 3718745
Ján Pich, “Learning algorithms from circuit lower bounds”, comput. complex., 34, № 1, 2025, 6
Rahul Ilango, “The Minimum Formula Size Problem is (ETH) Hard”, SIAM J. Comput., 2025, FOCS21-393
Rahul Santhanam, Iddo Tzameret, “Iterated Lower Bound Formulas: A Diagonalization-Based Approach to Proof Complexity”, SIAM J. Comput., 2025, STOC21-313
Benny Applebaum, Oded Nir, Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025, 965
Albert Atserias, Iddo Tzameret, Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025, 1096
Yizhi Huang, Rahul Ilango, Hanlin Ren, “NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach”, SIAM J. Comput., 54, № 4, 2025, 819