Wiki Τμήματος Μαθηματικών
Complexity Theory (ΠΛ1): Διαφορά μεταξύ των αναθεωρήσεων

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...')
 
Χωρίς σύνοψη επεξεργασίας
Γραμμή 15: Γραμμή 15:
|-
|-
! Course Code
! Course Code
| ΧΧΧ
| ΠΛ1
|-
|-
! Semester
! Semester
| 000
| 1
|-
|-
! Course Title
! Course Title
| ΧΧΧ
| Complexity Theory
|-
|-
! Independent Teaching Activities
! Independent Teaching Activities
Γραμμή 27: Γραμμή 27:
|-
|-
! Course Type
! Course Type
| General Background
| Elective
|-
|-
! Prerequisite Courses
! Prerequisite Courses
Γραμμή 34: Γραμμή 34:
! 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: Γραμμή 49:
! 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: Γραμμή 77:
! 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: Γραμμή 92:
| 39
| 39
|-
|-
| ΧΧΧ
| Working independently
| 000
| 78
|-
|-
| ΧΧΧ
| Exercises - Homework
| 000
| 70.5
|-
|-
| Course total  
| Course total  
Γραμμή 93: Γραμμή 104:
! Student Performance Evaluation
! Student Performance Evaluation
|
|
ΧΧΧ
* Written work (50%).
* Essay / report (20%).
* Public presentation (30%).
|}
|}


Γραμμή 99: Γραμμή 112:


<!-- 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:MAM199-Biblio -->
<!-- https://wiki.math.uoi.gr/index.php/%CE%A0%CF%81%CF%8C%CF%84%CF%85%CF%80%CE%BF:MAM165-Biblio -->


{{MAM199-Biblio}}
{{MAM165-Biblio}}

Αναθεώρηση της 17:16, 10 Νοεμβρίου 2022

Graduate Courses Outlines - Department of Mathematics

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:

  • Understand complexity classes.
  • Push further techniques for solving difficult problems.
  • Understand difficult problems by using reductions.
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

  • ΝΡ 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
Activity Semester Workload
Lectures 39
Working independently 78
Exercises - Homework 70.5
Course total 187.5
Student Performance Evaluation
  • Written work (50%).
  • Essay / report (20%).
  • Public presentation (30%).

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.
Ανακτήθηκε από «https://wiki.math.uoi.gr/index.php?title=Complexity_Theory_(ΠΛ1)&oldid=2129»