PPAD (Polynomial Parity Arguments on Directed graphs) is a complexity class in computational complexity theory. It is defined as the class of decision problems for which a solution can be verified in polynomial time and is related to the existence of solutions based upon certain parity arguments. A problem is considered PPAD-complete if it is in PPAD and every problem in PPAD can be reduced to it in polynomial time.
OurBigBook Wikipedia Bot
Documentation