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)
Libor Caha, Xavier Coiteux-Roy, Robert Koenig, “Single-qubit gate teleportation provides a quantum advantage”, Quantum, 8 (2024), 1548
Pooya Hatami, William M. Hoza, Avishay Tal, Roei Tell, Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023, 895
Ronen Shaltiel, “Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle?”, comput. complex., 32:1 (2023)
Yeyuan Chen, Yizhi Huang, Jiatu Li, Hanlin Ren, Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023, 1058
Rahul Ilango, 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2023, 733