![](images/graphics/blank.gif)
Lecture Design and Analysis of Algorithms - Lecture 16: NP-Completeness
11
lượt xem 2
download
lượt xem 2
download
![](https://tailieu.vn/static/b2013az/templates/version1/default/images/down16x21.png)
The following will be discussed in this chapter: NP-Hard and NP-Complete problems, 3SAT, Super Mario Brothers, 3 Dimensional Matching (3DM), Subset Sum, Partition, Rectangle Packing, Jigsaw Puzzles.
Chủ đề:
Bình luận(0) Đăng nhập để gửi bình luận!
![](images/graphics/blank.gif)
CÓ THỂ BẠN MUỐN DOWNLOAD