Large-scale Knowledge Processing: Lecture 4
2024.12.11 (Wed) 2nd period
Today's Lecture：Foundations on Theory of Computation 2
- Reduction
- NP-complete Problem
- Polynomial-time Reduction from CNF-SAT to 3SAT
- Polynomial-time Reduction from 3SAT to Vertex Cover Problem
Materials
Slides
2024.12.6 Constructed. Lecturer：Kazuhisa Seto
seto @ ist.hokudai.ac.jp