Numbering Code	G-INF06 63614 LE10	Year/Term	2022 ・ Second semester
Number of Credits	2	Course Type	Lecture
Target Year		Target Student
Language	English	Day/Period	Wed.2
Instructor name	Jesper Jansson (Graduate School of Informatics Program-Specific Associate Professor) MINATO SHINICHI (Graduate School of Informatics Professor) KAWAHARA JUN (Graduate School of Informatics Associate Professor)
Outline and Purpose of the Course	The main goal of computational complexity is to classify computational problems according to their difficulty by investigating the amount of resource needed to solve them. This graduate course on the theory of computational complexity will consist of two parts. The first part will present the foundations of computation complexity, and in particular the theory of NP-completeness. The second part will develop more advanced (and modern) topics related to ongoing research activities.
Course Goals	At the end of the course, the students should understand the foundations of computational complexity (in particular, the theory of NP-completeness) and the basics of the topics discussed in the second part.
Schedule and Contents	1. Introduction: algorithms and complexity (1 week) 2. Turing machines, time and space complexity (2 weeks) 3. Reductions and NP-Completeness (3 weeks) a. Reductions b. Cook-Levin Theorem c. Examples of NP-complete problems 4. Advanced topics related to ongoing research (1) (4 weeks) 5. Advanced topics related to ongoing research (2) (4 weeks) 6. Feedback (1 week)
Evaluation Methods and Policy	Evaluation on submitted reports.
Course Requirements	None
Study outside of Class (preparation and review)	The instructor expects students to spend enough time after each class for review. Additionally, mandatory reading material and assignments will be given during the course.
References, etc.	Computational Complexity: A Modern Approach, S. Arora and B. Barak, (Cambridge University Press), ISBN:978-0521424264 Introduction to Automata Theory, Languages, and Computation (3rd edition), John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, (Addison Wesley, 2006), ISBN:978-0321455369