Author:
Sotiraki Katerina,Zampetakis Manolis,Zirdelis Giorgos
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Separations in Proof Complexity and TFNP;Journal of the ACM;2024-08
2. Black-Box PPP Is Not Turing-Closed;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
3. Separations in Proof Complexity and TFNP;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
4. The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich;SIAM Journal on Computing;2022-02-28
5. The classes PPA-k: Existence from arguments modulo k;Theoretical Computer Science;2021-09