|
|
|
|
| LEADER |
00683 a2200169 4500 |
| 005 |
20151026133052.0 |
| 008 |
120514t xxu||||| |||| 00| 0 eng d |
| 080 |
|
|
|a 519.6
|b GOL
|
| 100 |
|
|
|a Goldreich, Oded
|9 7447
|
| 245 |
|
|
|a P, NP and NP Completeness
|b the basics of computational complexity
|
| 300 |
|
|
|a xxix, 184p.
|
| 653 |
|
|
|a Computational complexity
|a computer algorithms
|a Approximation theory
|a Polynomials
|
| 942 |
|
|
|c BK
|6 _
|
| 260 |
|
|
|b Cambridge University Press
|c 2010
|a Cambridge
|9 13477
|
| 020 |
|
|
|a 9780521122542
|
| 999 |
|
|
|c 62554
|d 62554
|
| 952 |
|
|
|0 0
|1 0
|2 udc
|4 0
|6 5196_GOL
|7 0
|9 75088
|a UL
|b UL
|c GEN
|d 2012-01-07
|e 89
|g 0.00
|l 2
|o 519.6 GOL
|p 00066703
|r 2015-09-29
|s 2015-09-29
|v 0.00
|w 2012-01-07
|y BK
|