Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael R. Garey, David S. Johnson
Informasi Umum
Kode
17.01.459
Klasifikasi
519.4 - Applied numerical analysis
Jenis
Buku - Circulation (Dapat Dipinjam)
Subjek
Computer Algorithms
No. Rak
10b
Dilihat
3 kali
Informasi Lainnya
Abstraksi
A readable, straightforward guide by two authors with extensive experience in the field. This text shows how to recognize NP-complete problems and offers practical suggestions for dealing with them effectively. It 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.
Koleksi & Sirkulasi
Tersedia 2 dari total 2 Koleksi
Anda harus log in untuk mengakses flippingbook
Pengarang
| Nama | Michael R. Garey, David S. Johnson |
| Jenis | Perorangan |
| Penyunting | |
| Penerjemah |
Penerbit
| Nama | Freeman |
| Kota | New York |
| Tahun | 1979 |
Sirkulasi
| Harga sewa | IDR 0,00 |
| Denda harian | IDR 1.000,00 |
| Jenis | Sirkulasi |
