Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR05-134 | 17th November 2005 00:00

3-NASH is PPAD-Complete

RSS-Feed




TR05-134
Authors: Xi Chen, Xiaotie Deng
Publication: 18th November 2005 02:04
Downloads: 3220
Keywords: 


Abstract:

In this paper, we improve a recent result of Daskalakis, Goldberg and Papadimitriou on PPAD-completeness of 4-Nash, showing that 3-Nash is PPAD-complete.



ISSN 1433-8092 | Imprint