filmov
tv
7. Planar SAT
Показать описание
MIT 6.890 Algorithmic Lower Bounds: Fun with Hardness Proofs, Fall 2014
Instructor: Erik Demaine
In this lecture, Professor Demaine introduces planar versions of 3SAT, proving these versions are NP-hard.
License: Creative Commons BY-NC-SA
Instructor: Erik Demaine
In this lecture, Professor Demaine introduces planar versions of 3SAT, proving these versions are NP-hard.
License: Creative Commons BY-NC-SA
1:23:03
0:00:16
0:00:26
0:04:13
0:00:15
0:00:23
0:01:36
0:00:19
1:18:40
0:14:34
0:03:15
0:00:23
0:02:52
0:00:37
0:03:35
0:01:33
0:12:50
0:02:40
1:20:32
0:07:27
0:01:47
0:59:49
0:06:44
0:01:47