Computational complexity interactive proof (1) deterministic interactive proof

Save
2 years ago

Computational complexity interactive proof (1) deterministic interactive proof

0:00 start
9:00 prove dIP=NP

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/

Loading comments...