Josh Alman, Jingxun Liang, Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025, 1383
Lijie Chen, Ron D. Rothblum, Roei Tell, Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025, 977
Yizhi Huang, Rahul Ilango, Hanlin Ren, “NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach”, SIAM J. Comput., 54:4 (2025), 819
Yuyu Wang, Lecture Notes in Computer Science, 16004, Advances in Cryptology – CRYPTO 2025, 2025, 38
И. С. Сергеев, “Нижние оценки аддитивной сложности линейных операторов и билинейных алгоритмов умножения матриц и многочленов над $GF(2)$”, Матем. заметки, 118:4 (2025), 607–624
Lijie Chen, “Nondeterministic Quasi-Polynomial Time is Average-Case Hard for $\textsf{ACC}$ Circuits”, SIAM J. Comput., 2024, FOCS19-332
Yilei Chen, Jiatu Li, Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024, 620
Shivam Nadimpalli, Natalie Parham, Francisca Vasconcelos, Henry Yuen, Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024, 1498
Yuyu Wang, Chuanjie Su, Jiaxin Pan, Lecture Notes in Computer Science, 14921, Advances in Cryptology – CRYPTO 2024, 2024, 251
Ján Pich, “Localizability of the approximation method”, comput. complex., 33:2 (2024)