NP: How Non-determinism Relates to Verifiable Proofs

There are multiple, surprisingly different, ways to think of NP problems. Let's talk about these different definitions and why they're equivalent.

Created by: Cory Chang
Produced by: Vivian Liu
Script Editor: Justin Chen, Zachary Greenberg, Elaine Chang

Twitter: https://twitter.com/UBehavior

—

P vs NP Playlist: https://www.youtube.com/playlist?list=PLlwsleWT767dnN25K_QgvdKkovK_t4K6-
NP: https://en.wikipedia.org/wiki/NP_(complexity)
Deterministic Algorithm: https://en.wikipedia.org/wiki/Deterministic_algorithm
Non-deterministic Algorithm: https://en.wikipedia.org/wiki/Non-deterministic_Turing_machine

Видео NP: How Non-determinism Relates to Verifiable Proofs канала Undefined Behavior