Introduction to Computational Complexity (MAE542): Διαφορά μεταξύ των αναθεωρήσεων
Από Wiki Τμήματος Μαθηματικών
Γραμμή 113: | Γραμμή 113: | ||
=== Attached Bibliography === | === Attached Bibliography === | ||
See [https://service.eudoxus.gr/public/departments#20 Eudoxus]. Additionally: | See the official [https://service.eudoxus.gr/public/departments#20 Eudoxus site] or the [https://cloud.math.uoi.gr/index.php/s/62t8WPCwEXJK7oL local repository] of Eudoxus lists per academic year, which is maintained by the Department of Mathematics. Additionally: | ||
* [Pa98] "Computational Complexity", Christos Papadimitriou. | * [Pa98] "Computational Complexity", Christos Papadimitriou. | ||
* [GJ77] "Computers and Intractability", M. R. Garey and D. S. Johnson. | * [GJ77] "Computers and Intractability", M. R. Garey and D. S. Johnson. | ||
* [KT] J. Kleinberg and E. Tardos, Σχεδιασμός Αλγορίθμων, ελληνική έκδοση, Εκδόσεις Κλειδάριθμος, 2008 | * [KT] J. Kleinberg and E. Tardos, Σχεδιασμός Αλγορίθμων, ελληνική έκδοση, Εκδόσεις Κλειδάριθμος, 2008 | ||
* [CLRS] T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Εισαγωγή στους Αλγορίθμους, ελληνική έκδοση, Πανεπιστημιακές Εκδόσεις Κρήτης, 2012. | * [CLRS] T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Εισαγωγή στους Αλγορίθμους, ελληνική έκδοση, Πανεπιστημιακές Εκδόσεις Κρήτης, 2012. |
Αναθεώρηση της 10:45, 26 Ιουλίου 2022
Undergraduate Courses Outlines - Department of Mathematics
General
School |
School of Science |
---|---|
Academic Unit |
Department of Mathematics |
Level of Studies |
Undergraduate |
Course Code |
MAE542 |
Semester |
5 |
Course Title |
Introduction to Computational Complexity |
Independent Teaching Activities |
Lectures, exercises, tutorials (Weekly Teaching Hours: 3, Credits: 6) |
Course Type |
Special Background |
Prerequisite Courses | - |
Language of Instruction and Examinations |
Greek |
Is the Course Offered to Erasmus Students |
Yes |
Course Website (URL) | - |
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
See the official Eudoxus site or the local repository of Eudoxus lists per academic year, which is maintained by the Department of Mathematics. Additionally:
- [Pa98] "Computational Complexity", Christos Papadimitriou.
- [GJ77] "Computers and Intractability", M. R. Garey and D. S. Johnson.
- [KT] J. Kleinberg and E. Tardos, Σχεδιασμός Αλγορίθμων, ελληνική έκδοση, Εκδόσεις Κλειδάριθμος, 2008
- [CLRS] T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Εισαγωγή στους Αλγορίθμους, ελληνική έκδοση, Πανεπιστημιακές Εκδόσεις Κρήτης, 2012.