Computers and intractability : a guide to the theory of NP-completeness
Αποθηκεύτηκε σε:
| Κύριος συγγραφέας: | |
|---|---|
| Άλλοι συγγραφείς: | |
| Μορφή: | Βιβλίο |
| Γλώσσα: | English |
| Δημοσίευση: |
San Francisco :
W. H. Freeman,
c1979
|
| Σειρά: | A series of books in mathematical sciences
|
| Θέματα: | |
| Ετικέτες: |
Προσθήκη ετικέτας
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!
|
MARC
| LEADER | 00000cam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | 1/42034 | ||
| 008 | 941103s1979 eng d | ||
| 020 | |a 0716710455 | ||
| 020 | |a 0716710447 | ||
| 035 | |a 1994 |c ΚΑΤΣΙΚΑΣ |l 10041656 | ||
| 040 | |a GR-MY-UA |b gre |e aacr | ||
| 041 | 0 | |a eng | |
| 082 | 0 | |a 519.4 | |
| 100 | 1 | |a Garey, Michael R. | |
| 245 | 1 | 0 | |a Computers and intractability : |b a guide to the theory of NP-completeness / |c Michael R. Garey, David S. Johnson |
| 246 | 3 | 3 | |a NP-completeness |
| 260 | |a San Francisco : |b W. H. Freeman, |c c1979 | ||
| 300 | |a x, 338 p.; |b ill.; |c 24 cm. | ||
| 490 | 1 | |a A series of books in the mathematical sciences | |
| 504 | |a Includes bibliography ( p. [291]-325 ) and indexes | ||
| 650 | 0 | 0 | |a Computer programming. |
| 650 | 0 | 0 | |a Computer algorithms. |
| 650 | 0 | 0 | |a Computational complexity. |
| 700 | 1 | |a Johnson, David S. |d 1945- | |
| 830 | 0 | |a A series of books in mathematical sciences | |
| 852 | |a INST |b SAMOS |e 19941103 |h 519.4 GAR |p 005300002599 |q 005300002599 |t BK |y 0 | ||
| 909 | |a Σ |b 034048 | ||