Κεφάλαιο 11Adobe PDF
(229.8 kB)
| Title Details: | |
|
Computability and Complexity |
|
| Authors: |
Zachos, Efstathios Pagourtzis, Aristeidis Souliou, Theodora |
| Reviewer: |
Zissimopoulos, Vassilis |
| Description: | |
| Abstract: |
Basic concepts of computation theory. Computational problems. Computation models. Uncomputability: Goedel, Turing, Church. The Termination Problem. Computational complexity: Hartmanis, Cook, Karp. Classes P and NP, PSPACE and NP. Reductions and completeness. NP-complete problems.
|
| Type: |
Chapter |
| Creation Date: | 2015 |
| Item Details: | |
| License: |
http://creativecommons.org/licenses/by-nc-sa/3.0/gr |
| Handle | http://hdl.handle.net/11419/5462 |
| Bibliographic Reference: | Zachos, E., Pagourtzis, A., & Souliou, T. (2015). Computability and Complexity [Chapter]. In Zachos, E., Pagourtzis, A., & Souliou, T. 2015. Computer Science Foundation [Undergraduate textbook]. Kallipos, Open Academic Editions. https://hdl.handle.net/11419/5462 |
| Language: |
Greek |
| Is Part of: |
Computer Science Foundation |
| Publication Origin: |
Kallipos, Open Academic Editions |