PPAD (complexity)

（重定向自PPAD）

In computer science, PPAD ("Polynomial Parity Arguments on Directed graphs") is a complexity class introduced by Christos Papadimitriou in 1994. PPAD is a subclass of TFNP based on functions that can be shown to be total by a parity argument. The class attracted significant attention in the field of algorithmic game theory because it contains the problem of computing a Nash equilibrium, and this problem was shown by Chen and Deng in 2005 to be complete for the class.

单词	PPAD
释义	PPAD 英语百科 PPAD (complexity) （重定向自PPAD） In computer science, PPAD ("Polynomial Parity Arguments on Directed graphs") is a complexity class introduced by Christos Papadimitriou in 1994. PPAD is a subclass of TFNP based on functions that can be shown to be total by a parity argument. The class attracted significant attention in the field of algorithmic game theory because it contains the problem of computing a Nash equilibrium, and this problem was shown by Chen and Deng in 2005 to be complete for the class.
随便看	Navajo Point Navajo Sandstone Navajos, Pico de Navajo white NavajoWhite Navajo whites Navajo wool naval naval academies naval academy naval advanced logistic support site navalady Naval Aeronautical Medical Center naval aeronautics naval aeroplane Naval Aerospace Medical Center naval aerospace medical institute Naval Aerospace Medical Research Laboratory Navalagamella naval aid auxiliary naval air Naval Air Arm Naval aircraft Naval Air Development Center Naval Air Development Unit