講義概要
We study basics of computational complexity theory, and
discuss some of the recent advanced topics.
This course will be given in Japanese, but for those who want get English instruction,
please consult the instructor after the class or via email.
計算の複雑さの理論の入門的な部分を中心に講義し，
特定のテーマに関して現在の研究の一端を紹介する．
講義の目的
Computational complexity theory is one of the basic subjects in computer science
because it is a basis of the design and analysis of algorithms and we may be able
to understand the nature of computation well through our understanding of the
limit of computations.
講義計画
1. Machine model
2. Complexity measures
3. Various complexity classes
4. Time hierarachy theorem
5. Reducibility, NP-complentess
6. Some advanced topics
教科書・参考書等
References (no textbook)
M. Sipser, Introduction to the Theory of Computation, PWS Pub., 1997.
J. Van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol.A: Algorithms and Complexity, Elsevier, 1990.
R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge Univ. Press, 1995.
授業でプリントを配布する予定です．教科書は使いません．
関連科目・履修の条件等
basic course on programming
成績評価
Reports on several problems given in the course
連絡先（メール、電話番号）
watanabe＠is.titech.ac.jp
