| 000 | 00868cam a22002894a 4500 | ||
|---|---|---|---|
| 003 | inmoiis | ||
| 005 | 20161109173911.0 | ||
| 020 | _a9780521192484 (hardback) | ||
| 020 | _a9780521122542 (pbk.) | ||
| 040 | _ainmoiis | ||
| 041 | _aEng | ||
| 044 | _aXXU | ||
| 082 | 0 | 0 |
_a005.1 _222 _bGOL-P |
| 100 | 1 |
_aGoldreich, Oded. _91430 |
|
| 245 | 1 | 0 |
_aP, NP, and NP-completeness : _bthe basics of computational complexity _cOded Goldreich. |
| 250 | _a1st pub 2010 | ||
| 260 |
_aNew York : _bCambridge University Press, _c2010. |
||
| 300 |
_a 184 p. : _bill. ; |
||
| 500 | _aIncludes bibliographical references and index. | ||
| 650 | 0 |
_aComputational complexity. _91431 |
|
| 650 | 0 |
_aComputer algorithms. _91432 |
|
| 650 | 0 |
_aApproximation theory. _91433 |
|
| 650 | 0 |
_aPolynomials. _91434 |
|
| 902 | _0IISER Mohali | ||
| 942 |
_2ddc _cBK |
||
| 999 |
_c3089 _d3089 |
||