Elements of the Theory of Computation Harry R. Lewis; Christos H. Papadimitriou
Material type:
- 511 LEW
Item type | Current library | Collection | Call number | Status | Barcode | |
---|---|---|---|---|---|---|
![]() |
CUTN Central Library Sciences | Non-fiction | 511 LEW (Browse shelf(Opens below)) | Available | 33915 | |
![]() |
CUTN Central Library Sciences | Non-fiction | 511 LEW (Browse shelf(Opens below)) | Available | 33916 | |
![]() |
CUTN Central Library Sciences | Non-fiction | 511 LEW (Browse shelf(Opens below)) | Available | 33917 | |
![]() |
CUTN Central Library Sciences | Non-fiction | 511 LEW (Browse shelf(Opens below)) | Available | 33918 | |
![]() |
CUTN Central Library Sciences | Reference | 511 LEW (Browse shelf(Opens below)) | Not For Loan | 33919 |
1. Sets, Relations, and Languages
2. Finite Automata
3. Context-free Languages
4. Turing Machines
5. Undecidability
6. Computational Complexity
7. NP-completeness
Appropriate for senior and graduate level courses in Computer Science Theory, Automata, and Theory of Computation.
This is the long awaited Second Edition of Lewis and Papadimitriou's best-selling theory of computation text. In this substantially modified edition, the authors have enhanced the clarity of their presentation by making the material more accessible to a broader undergraduate audience with no special mathematical experience.
There are no comments on this title.