Complexity Theory (ΠΛ1): Διαφορά μεταξύ των αναθεωρήσεων
Από Wiki Τμήματος Μαθηματικών
(Νέα σελίδα με 'Graduate Courses Outlines - [https://math.uoi.gr Department of Mathematics] === General === {| class="wikitable" |- ! School | School of Science |- ! Academic Unit | Department of Mathematics |- ! Level of Studies | Graduate |- ! Course Code | ΧΧΧ |- ! Semester | 000 |- ! Course Title | ΧΧΧ |- ! Independent Teaching Activities | Lectures (Weekly Teaching Hours: 3, Credits: 7.5) |- ! Course Type | General Background |- ! Prerequisite Courses | - |- ! L...') |
Χωρίς σύνοψη επεξεργασίας |
||
(4 ενδιάμεσες αναθεωρήσεις από τον ίδιο χρήστη δεν εμφανίζεται) | |||
Γραμμή 1: | Γραμμή 1: | ||
[[ | * [[Θεωρία Πολυπλοκότητας (ΠΛ1)|Ελληνική Έκδοση]] | ||
{{Course-Graduate-Top-EN}} | |||
{{Menu-OnAllPages-EN}} | |||
=== General === | === General === | ||
Γραμμή 15: | Γραμμή 17: | ||
|- | |- | ||
! Course Code | ! Course Code | ||
| | | ΠΛ1 | ||
|- | |- | ||
! Semester | ! Semester | ||
| | | 1 | ||
|- | |- | ||
! Course Title | ! Course Title | ||
| | | Complexity Theory | ||
|- | |- | ||
! Independent Teaching Activities | ! Independent Teaching Activities | ||
Γραμμή 27: | Γραμμή 29: | ||
|- | |- | ||
! Course Type | ! Course Type | ||
| | | Elective | ||
|- | |- | ||
! Prerequisite Courses | ! Prerequisite Courses | ||
Γραμμή 34: | Γραμμή 36: | ||
! Language of Instruction and Examinations | ! Language of Instruction and Examinations | ||
| | | | ||
Greek | |||
|- | |- | ||
! Is the Course Offered to Erasmus Students | ! Is the Course Offered to Erasmus Students | ||
| Yes | | Yes (in English) | ||
|- | |- | ||
! Course Website (URL) | ! Course Website (URL) | ||
Γραμμή 49: | Γραμμή 51: | ||
! Learning outcomes | ! Learning outcomes | ||
| | | | ||
This course aims at introducing to students the concepts of time and space complexities for solving difficult problems. After successfully passing this course the students will be able to: | |||
* Understand complexity classes. | |||
* Push further techniques for solving difficult problems. | |||
* Understand difficult problems by using reductions. | |||
|- | |- | ||
! General Competences | ! General Competences | ||
| | | | ||
* Search for, analysis and synthesis of data and information, with the use of the necessary technology | |||
* Working independently | |||
* Team work | |||
* Project planning and management | |||
|} | |} | ||
=== Syllabus === | === Syllabus === | ||
* ΝΡ and Computational Intractibility | |||
* The class of PSPACE | |||
* Extending the limits of tractability | |||
* Approximation Algorithms | |||
* Local search. | |||
* Randomized algorithms | |||
=== Teaching and Learning Methods - Evaluation === | === Teaching and Learning Methods - Evaluation === | ||
Γραμμή 66: | Γραμμή 79: | ||
! Delivery | ! Delivery | ||
| | | | ||
Lectures | |||
|- | |- | ||
! Use of Information and Communications Technology | ! Use of Information and Communications Technology | ||
| | | | ||
Use of projector and interactive board during lectures. | |||
|- | |- | ||
! Teaching Methods | ! Teaching Methods | ||
Γραμμή 81: | Γραμμή 94: | ||
| 39 | | 39 | ||
|- | |- | ||
| | | Working independently | ||
| | | 78 | ||
|- | |- | ||
| | | Exercises - Homework | ||
| | | 70.5 | ||
|- | |- | ||
| Course total | | Course total | ||
Γραμμή 93: | Γραμμή 106: | ||
! Student Performance Evaluation | ! Student Performance Evaluation | ||
| | | | ||
* Written work (50%). | |||
* Essay / report (20%). | |||
* Public presentation (30%). | |||
|} | |} | ||
Γραμμή 99: | Γραμμή 114: | ||
<!-- In order to edit the bibliography, visit the webpage --> | <!-- In order to edit the bibliography, visit the webpage --> | ||
<!-- https://wiki.math.uoi.gr/index.php/%CE%A0%CF%81%CF%8C%CF%84%CF%85%CF%80%CE%BF: | <!-- https://wiki.math.uoi.gr/index.php/%CE%A0%CF%81%CF%8C%CF%84%CF%85%CF%80%CE%BF:MAM165-Biblio --> | ||
{{ | {{MAM165-Biblio}} |
Τελευταία αναθεώρηση της 05:17, 16 Ιουνίου 2023
- Ελληνική Έκδοση
- Graduate Courses Outlines
- Outline Modification (available only for faculty members)
- Department of Mathematics
- Save as PDF or Print (to save as PDF, pick the corresponding option from the list of printers, located in the window which will popup)
General
School | School of Science |
---|---|
Academic Unit | Department of Mathematics |
Level of Studies | Graduate |
Course Code | ΠΛ1 |
Semester | 1 |
Course Title | Complexity Theory |
Independent Teaching Activities | Lectures (Weekly Teaching Hours: 3, Credits: 7.5) |
Course Type | Elective |
Prerequisite Courses | - |
Language of Instruction and Examinations |
Greek |
Is the Course Offered to Erasmus Students | Yes (in English) |
Course Website (URL) | See eCourse, the Learning Management System maintained by the University of Ioannina. |
Learning Outcomes
Learning outcomes |
This course aims at introducing to students the concepts of time and space complexities for solving difficult problems. After successfully passing this course the students will be able to:
|
---|---|
General Competences |
|
Syllabus
- ΝΡ and Computational Intractibility
- The class of PSPACE
- Extending the limits of tractability
- Approximation Algorithms
- Local search.
- Randomized algorithms
Teaching and Learning Methods - Evaluation
Delivery |
Lectures | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Use of Information and Communications Technology |
Use of projector and interactive board during lectures. | ||||||||||
Teaching Methods |
| ||||||||||
Student Performance Evaluation |
|
Attached Bibliography
- Computational Complexity, Christos Papadimitriou.
- Computers and Intractability, M. R. Garey and D. S. Johnson.
- J. Kleinberg and E. Tardos, Σχεδιασμός Αλγορίθμων, ελληνική έκδοση, Εκδόσεις Κλειδάριθμος, 2008
- T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Εισαγωγή στους Αλγορίθμους, ελληνική έκδοση, Πανεπιστημιακές Εκδόσεις Κρήτης, 2012.