| 000 | 01244 a2200361 4500 | ||
|---|---|---|---|
| 001 | 12195 | ||
| 650 |
_91359 _aComputational complexity |
||
| 999 |
_c12195 _d1805 |
||
| 003 | TR-AnTOB | ||
| 005 | 20231117150811.0 | ||
| 008 | 970418s1998 njua b 001 0 eng | ||
| 010 | _a97013879 | ||
| 020 | _a0132624788 | ||
| 035 | 9 | _a(SBN)ALT4007 | |
| 035 | _a(OCoLC)ocm36798346 | ||
| 040 |
_aDLC _cDLC _dOrLoB-B |
||
| 041 | _aeng | ||
| 050 | 0 |
_aQA267 _b.L49 1998 |
|
| 090 | _aQA267 .L49 1998 | ||
| 100 |
_aLewis, Harry R. _94695 |
||
| 245 | 0 |
_aElements of the theory of computation / _cHarry R. Lewis, Christos H. Papadimitriou. |
|
| 250 | _a2nd ed. | ||
| 264 | 1 |
_aUpper Saddle River, N.J. : _bPrentice-Hall, _cc1998. |
|
| 300 |
_a361 p. : _bill. ; _c25 cm. |
||
| 504 | _aIncludes bibliographical references and index. | ||
| 505 | 0 | _a1. Sets, Relations, and Languages --2. Finite Automata --3. Context-free Languages --4. Turing machines --5. Undecidability --6. Computational Complexity --7. NP-completeness. | |
| 650 |
_aLogic, Symbolic and mathematical _91361 |
||
| 650 |
_aFormal languages _94379 |
||
| 650 |
_aMachine theory _91804 |
||
| 700 | 1 |
_aPapadimitriou, Christos H. _94696 |
|
| 942 | _cBK | ||