 |
ISBN
| 9780716710455 | |
DDC
| 005.1 | |
Tác giả CN
| Garey, Michael R. | |
Nhan đề
| Computers and intractability : a guide to the theory of NP-completeness / Michael R Garey; David S Johnson | |
Thông tin xuất bản
| San Francisco : W.H. Freeman, 1979 | |
Mô tả vật lý
| x, 338 pages. : illustrations ; 23 cm. | |
Tùng thư
| Series of books in the mathematical sciences. | |
Tóm tắt
| "Shows how to recognize NP-complete problems and offers proactical suggestions for dealing with them effectively. The book covers the basic theory of NP-completeness, provides an overview of alternative directions for further research, and contains and extensive list of NP-complete and NP-hard problems, with more than 300 main entries and several times as many results in total. [This book] is suitable as a supplement to courses in algorithm design, computational complexity, operations research, or combinatorial mathematics, and as a text for seminars on approximation algorithms or computational complexity. It provides not only a valuable source of information for students but also an essential reference work for professionals in computer science"- | |
Thuật ngữ chủ đề
| Computer programming | |
Thuật ngữ chủ đề
| Computer algorithms | |
Thuật ngữ chủ đề
| Algorithms | |
Thuật ngữ chủ đề
| Computational complexity | |
Khoa
| Khoa Công nghệ Thông tin | |
Tác giả(bs) CN
| Johnson, David S., 1945- | |
Địa chỉ
| 300Q12_Kho Mượn_02(1): 073349 |
| |
000
| 00000nam#a2200000u##4500 |
|---|
| 001 | 24958 |
|---|
| 002 | 15 |
|---|
| 004 | FDE307D0-B91E-403D-899C-099A7C05EC9A |
|---|
| 005 | 202010191005 |
|---|
| 008 | 201019s1979 cau eng |
|---|
| 009 | 1 0 |
|---|
| 020 | |a9780716710455 |
|---|
| 039 | |a20201019100509|bnghiepvu|y20201019100324|znghiepvu |
|---|
| 040 | |aNTT |
|---|
| 041 | |aeng |
|---|
| 044 | |acau |
|---|
| 082 | |a005.1|bG229|223 |
|---|
| 100 | |aGarey, Michael R. |
|---|
| 245 | |aComputers and intractability : |ba guide to the theory of NP-completeness / |cMichael R Garey; David S Johnson |
|---|
| 260 | |aSan Francisco : |bW.H. Freeman, |c1979 |
|---|
| 300 | |ax, 338 pages. : |billustrations ; |c23 cm. |
|---|
| 490 | |aSeries of books in the mathematical sciences. |
|---|
| 504 | |aIncludes bibliographical references (pages 292-325) and index. |
|---|
| 520 | |a"Shows how to recognize NP-complete problems and offers proactical suggestions for dealing with them effectively. The book covers the basic theory of NP-completeness, provides an overview of alternative directions for further research, and contains and extensive list of NP-complete and NP-hard problems, with more than 300 main entries and several times as many results in total. [This book] is suitable as a supplement to courses in algorithm design, computational complexity, operations research, or combinatorial mathematics, and as a text for seminars on approximation algorithms or computational complexity. It provides not only a valuable source of information for students but also an essential reference work for professionals in computer science"- |
|---|
| 541 | |aDự án VN Book Drive |
|---|
| 650 | |aComputer programming |
|---|
| 650 | |aComputer algorithms |
|---|
| 650 | |aAlgorithms |
|---|
| 650 | |aComputational complexity |
|---|
| 690 | |aKhoa Công nghệ Thông tin |
|---|
| 700 | |aJohnson, David S., 1945- |
|---|
| 852 | |a300|bQ12_Kho Mượn_02|j(1): 073349 |
|---|
| 856 | 1|uhttp://elib.ntt.edu.vn/documentdata01/2 tailieuthamkhao/000 tinhocthongtin/anhbiasach/24958_computers and intractabilitythumbimage.jpg |
|---|
| 890 | |a1|b0|c0|d0 |
|---|
| |
| Dòng |
Mã vạch |
Nơi lưu |
S.gọi Cục bộ |
Phân loại |
Bản sao |
Tình trạng |
Thành phần |
Đặt chỗ |
|
1
|
073349
|
Q12_Kho Mượn_02
|
005.1 G229
|
Sách mượn tại chỗ
|
1
|
|
|
|
Không có liên kết tài liệu số nào
|
|
|
|