ECE 695NS Lecture 2: Computability and NP-hardness

[Audio] ECE 695NS: Numerical Simulations of Electro-optic Energy Systems

13/01/2017 7:39PM

Episode Synopsis "ECE 695NS Lecture 2: Computability and NP-hardness"

Outline:OverviewDefinitionsComputing MachinesChurch-Turing ThesisPolynomial Time (Class P)Class NPNon-deterministic Turing machinesReducibilityCook-Levin theoremCoping with NP Hardness

Listen "ECE 695NS Lecture 2: Computability and NP-hardness"

More episodes of the podcast [Audio] ECE 695NS: Numerical Simulations of Electro-optic Energy Systems