|
Dòng
|
Nội dung
|
|
1
|
Computers and intractability : a guide to the theory of NP-completeness / Michael R Garey; David S Johnson
San Francisco : W.H. Freeman, 1979
x, 338 pages. : illustrations ; 23 cm.
Ký hiệu phân loại (DDC): 005.1
"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"-
Số bản sách:
(1)
Tài liệu số:
(0)
|
|
|
|
|