Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference22 articles.
1. 2-D Tucker is PPA complete;Aisenberg;J. Comput. Syst. Sci.,2020
2. Settling the complexity of Nash equilibrium in congestion games;Babichenko,2021
3. The relative complexity of NP search problems;Beame;Ann. Pure Appl. Log.,1998
4. Zero-sum polymatrix games: a generalization of minmax;Cai;Math. Oper. Res.,2016
5. Settling the complexity of computing two-player Nash equilibria;Chen;J. ACM,2009
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Further Collapses in \(\boldsymbol{\mathsf{TFNP}}\);SIAM Journal on Computing;2024-05-02
2. The Complexity of Gradient Descent: CLS = PPAD ∩ PLS;Journal of the ACM;2022-12-19
3. The complexity of gradient descent: CLS = PPAD ∩ PLS;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15