Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Chen, X., Deng, X.: On Algorithms for Discrete and Approximate Brouwer Fixed Points. In: STOC 2005, pp. 323–330 (2005)
2. Chen, X., Deng, X.: On the Complexity of 2D Discrete Fixed Point Problem. ECCC, TR06-037 (2006)
3. Chen, X., Deng, X., Teng, S.-H.: Computing Nash equilibria: approximation and smoothed complexity. ECCC, TR06-023 (2006)
4. Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The Complexity of Computing a Nash Equilibrium. STOC 2006 (2006)
5. Friedl, K., Ivanyos, G., Santha, M., Verhoeven, Y.: Locally 2-dimensional Sperner problems complete for the Polynomial Parity Argument classes (submitted)
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献