トップ 差分 一覧 ソース 検索 ヘルプ PDF RSS ログイン

2012年度計算量理論

This is page of "Theory of Computational Complexity 2012"

From 2012/10/1〜

Part

Book by M.Sipser
Chapter day Speaker
3, 7.1-7.3 10/1 Teruyama
7.4 10/15 Tamura
8.1-8.3 10/22 Ishikawa
8.4-8.6 10/29 Ding
9.1 11/5 HU Rui
9.2-9.3 11/12 Richardson
10.2 11/19 Nishimura
11/26 - no lecture -
10.3 12/3 Nakamura
10.4 12/10 So
Book by Arora and Barak
Chapter day Speaker
6.1-6.4 12/17 Ueda
6.5-6.7 1/7 Stegemann
7.1-7.3 1/9 Zhang
7.4-7.5 1/15 Kusumoto
7.6-7.7 1/21 Pocthier
** 1/28 **

Past class

Book by M.Sipser
day speaker part slide file pdf(document) file
10/1 Teruyama Chapter 3 and 7.1-7.3 *chap3-7.3.pptx *chap3-7.3.pdf
10/15 Tamura Chapter 7.4
10/22 Ishikawa Chapter 8.1-8.3 *chap8.1-8.3.pptx *chap8.1-8.3.pdf
10/29 Ding Chapter 8.4-8.6 *chapter8.4-8.6.pptx *chapter8.4-8.6.pdf
11/5 Richardson Chapter 9.2-9.3
11/12 Hu Chapter 9.1 *9.1_HIERARCHY_THEOREMS.pptx *9.1_resume.docx
11/19 Nishimura Chapter 10.2 *chap10.2-ppt.pptx *chap10.2-summary.pdf
12/3 Nakamura Chapter 10.3
12/10 So Chapter 10.4
Book by Arora and Barak
day speaker part slide file pdf(document) file
6.1-6.4 12/17 Ueda *ueda.pptx *ueda.pdf
6.5-6.7 1/7 Stegemann *6.5-6.7_Presentation.pdf *6.5-6.7_Summary.pdf
7.1-7.3 1/9 Zhang *7.1-7.3_ppt.pdf *7.1-7.3_ZHANG_Yu.pdf
7.4-7.5 1/15 Kusumoto
7.6-7.7 1/21 Pocthier *7.6-7.7.pdf

The marked(*) slides are under the application of NYSDL license. You are free for copy, reprint and so on. ( When you upload your slides, please decide whether you apply NYSDL license to your slides or not. It is not forcing but grateful for your application.)

If you use the slide with no mark(*), please contact the person who make it.

textbook

Michael Sipser:Introduction to the Theory of Computation.Course Technology, 3rd edition, 2012.

Sanjeev Arora and Boaz Barak: Computational Complexity(A Modern Approach), Cambridge University Press.

Link