| 000 | 00822 a2200277 4500 | ||
|---|---|---|---|
| 001 | 10468 | ||
| 650 |
_91359 _aComputational complexity |
||
| 999 |
_c10468 _d447 |
||
| 003 | TR-AnTOB | ||
| 005 | 20200512171512.0 | ||
| 008 | 980622s1999 nyua b 001 0 eng | ||
| 010 | _a98033563 | ||
| 020 | _a0387986006 (hc. : alk. paper) | ||
| 040 |
_aDLC _cDLC _dDLC |
||
| 041 | _aeng | ||
| 050 | 0 |
_aQA267.7 _b.I46 1999 |
|
| 090 | _aQA267.7 .I46 1999 | ||
| 100 |
_aImmerman, Neil, _d1953- _91360 |
||
| 245 | 0 |
_aDescriptive complexity / _cNeil Immerman. |
|
| 264 | 1 |
_aNew York : _bSpringer, _cc1999. |
|
| 300 |
_axvi, 268 p. : _bill. ; _c25 cm. |
||
| 490 | 0 | _aGraduate texts in computer science | |
| 504 | _aIncludes bibliographical references (p. [251]-261) and index. | ||
| 650 |
_aLogic, Symbolic and mathematical _91361 |
||
| 942 | _cBK | ||