暂无分享,去创建一个
[1] Christos H. Papadimitriou,et al. Computational complexity , 1993 .
[2] Yu. B. Zudin,et al. Mat hemat ical Engineering , 2003 .
[3] Christos H. Papadimitriou,et al. On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence , 1994, J. Comput. Syst. Sci..
[4] Jean-Pierre Bourguignon,et al. Mathematische Annalen , 1893 .
[5] Xi Chen,et al. Computing Nash Equilibria: Approximation and Smoothed Complexity , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[6] Paul W. Goldberg,et al. The complexity of computing a Nash equilibrium , 2006, STOC '06.
[7] Xiaotie Deng,et al. Settling the Complexity of Two-Player Nash Equilibrium , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[8] Stefan Reisch,et al. Hex ist PSPACE-vollständig , 1981, Acta Informatica.
[9] E. Sperner. Neuer beweis für die invarianz der dimensionszahl und des gebietes , 1928 .
[10] D. Gale. The Game of Hex and the Brouwer Fixed-Point Theorem , 1979 .
[11] L. Brouwer. Über Abbildung von Mannigfaltigkeiten , 1921 .
[12] David Lichtenstein,et al. GO Is Polynomial-Space Hard , 1980, JACM.