|
|
|
|
| LEADER |
00784nam a2200253 4500 |
| 001 |
026195 |
| 003 |
arbauncb |
| 008 |
150429s1997 xxu g 000 0 eng d |
| 005 |
20171018124846.0 |
| 040 |
|
|
|a AR-BaUNCB
|c AR-BaUNCB
|
| 245 |
1 |
0 |
|a Computers and intractability a guide to the theory of NP-completeness /
|c Michael R. Garey y David S. Johnson.
|
| 260 |
|
|
|a New York :
|b W. H. Freeman,
|c 1997
|
| 440 |
|
0 |
|a Books in the mathematical sciences
|
| 300 |
|
|
|a 338 p.
|c 23 cm
|
| 020 |
|
|
|a 0716710455
|
| 100 |
1 |
|
|a Garey, Michael R.
|
| 700 |
1 |
|
|a Johnson, David S.
|
| 082 |
0 |
4 |
|a 519.4
|
| 653 |
|
|
|a Matemáticas aplicadas
|
| 653 |
|
|
|a Complejidad
|
| 650 |
|
7 |
|a Computación
|2 mpirdes
|
| 650 |
|
7 |
|a Algoritmos
|2 unescot
|
| 650 |
|
7 |
|a Programación de computadoras
|2 unescot
|
| 999 |
|
|
|c 26110
|d 26110
|