Υπολογισιμότητα και πολυπλοκότητα

Zachos, Efstathios; Pagourtzis, Aristeidis; Souliou, Theodora; Ζάχος, Ευστάθιος; Παγουρτζής, Αριστείδης; Σούλιου, Θεοδώρα

Κεφάλαιο 11Adobe PDF (229.8 kB)

Title Details:
Υπολογισιμότητα και πολυπλοκότητα
Authors:	Zachos, Efstathios Pagourtzis, Aristeidis Souliou, Theodora
Reviewer:	Zissimopoulos, Vassilis
Subject:	MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE > COMPUTATIONAL SCIENCE MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE > INFORMATION ASSURANCE AND SECURITY > CRYPTOGRAPHY MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE > ALGORITHMS AND COMPLEXITY MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE > ALGORITHMS AND COMPLEXITY > FUNDAMENTAL DATA STRUCTURES AND ALGORITHMS MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE > ALGORITHMS AND COMPLEXITY MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE > PROGRAMMING LANGUAGES MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE > DISCRETE STRUCTURES MATHEMATICS AND COMPUTER SCIENCE > MATHEMATICS > NUMERICAL ANALYSIS > NUMERICAL APPROXIMATION AND COMPUTATIONAL GEOMETRY MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE > SOFTWARE DEVELOPMENT FUNDAMENTALS MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE > INFORMATION MANAGEMENT > DATABASE SYSTEMS MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE > PROGRAMMING LANGUAGES MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE > GRAPHICS AND VISUALIZATION MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE > ARCHITECTURE AND ORGANIZATION > DIGITAL LOGIC AND DIGITAL SYSTEMS MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE > INTELLIGENT SYSTEMS > BASIC KNOWLEDGE REPRESENTATION AND REASONING MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE > INFORMATION MANAGEMENT > DATA MINING
Keywords:	Algorithms Search Algorithms Sorting Algorithms Algorithmic Composition Graphs Graph Algorithms Graph Theory String Algorithms Computability Computational Complexity Data Structures Automata Formal Languages Grammars Parallel Algorithms Distributed Algorithms Knowledge Representation And Reasoning Logic And Circuits Logic Logic For Computer Science
Description:
Abstract:	Βασικές έννοιες θεωρίας υπολογισμού. Υπολογιστικά προβλήματα. Μοντέλα υπολογισμού. Μη υπολογισιμότητα: Goedel, Turing, Church. Το Πρόβλημα Τερματισμού. Υπολογιστική Πολυπλοκότητα: Hartmanis, Cook, Karp. Κλάσεις P και NP, PSPACE και NP. Αναγωγές και πληρότητα. NP-πλήρη προβλήματα.
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). Υπολογισιμότητα και πολυπλοκότητα [Chapter]. In Zachos, E., Pagourtzis, A., & Souliou, T. 2015. Θεμελίωση επιστήμης υπολογιστών [Undergraduate textbook]. Kallipos, Open Academic Editions. https://hdl.handle.net/11419/5462
Language:	Greek
Is Part of:	Θεμελίωση επιστήμης υπολογιστών
Publication Origin:	Kallipos, Open Academic Editions