[
ECE 695NS Lecture 2: Computability and NP-hardness
from [Audio] ECE 695NS: Numerical Simulations of Electro-optic Energy Systems Hosted by Peter Bermel
Outline:OverviewDefinitionsComputing MachinesChurch-Turing ThesisPolynomial Time (Class P)Class NPNon-deterministic Turing machinesReducibilityCook-Levin theoremCoping with NP Hardness
Embed this episode
No transcript yet.
Frequently asked questions
When was this [Audio] ECE 695NS: Numerical Simulations of Electro-optic Energy Systems episode published?
This episode was published on January 13, 2017.
Can I download this [Audio] ECE 695NS: Numerical Simulations of Electro-optic Energy Systems episode?
Yes. Use the download control on the episode player to save the publisher-provided media file.