introduce Weird complexity class, TFNP PPA, PPAD, PPP

introduce Weird complexity class, TFNP PPA, PPAD, PPP

TFNP: the complexity class TFNP is the class of total function problems which can be solved in nondeterministic polynomial time.

PPAD: Polynomial Parity Arguments on Directed graphs

PPA: parity arguments for undirected graphs

More computational complexity theory:
https://www.youtube.com/playlist?list=PLg9w7tItBlZu5dzTT0xqtLrx-46jCfR4o

Donate to Channel(Support me): https://paypal.me/kuoenjui
Facebook: https://www.facebook.com/mathenjui
Instagram: https://www.instagram.com/mathphyen/