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

2011年度計算量理論

This is page of "Theory of Computational Complexity 2011"

From 2011/10/1〜

Part

Chapter day Speaker
1-1.3 10/3 sakaidani
1.4-2.3 10/17 sasanuma
2.4-3.3 10/24 Ao ZHU
3.4-4.6 10/31 Tarek BELKAHIA
5.1-5.4 11/7 inoshita
5.5-5.8 11/21 furukawa
6.1-6.5 11/28 tyou
6.6-6.10 12/12 inada
7.1-7.2 12/26 cheng
7.3-7.6 1/23 Lee minseon

Past class

day speaker part slide and pdf file
10/3 sakaidani chapter1.1-1.3 *Theory of Computational Complexity_sakaidani.pdf *Theory of Computational Complexity_sakaidani.pptx
10/17 sasanuma chapter1.4-2.3 *Theory of Computational Complexity_sasanuma.pdf *Theory of Computational Complexity_sasanuma.pptx
10/24 ZHU chapter2.4-3.3 *zhu ao rinkou.docx *zhu ao_rinkou.ppt
10/31 Tarek chapter3.4-4.6 *Theory of Computational Complexity_Tarek.pdf
11/7 inoshita chapter5.1-5.4 *Theory of Computational Complexity_inoshita.pdf *Theory of Computational Complexity_inoshita.pptx
11/21 furukawa chapter5.5-5.8 *Theory of Computational Complexity_furukawa.pdf *Theory of Computational Complexity_furukawa.pptx
11/28 tyou chapter6.1-6.5 *Theory of Computational Complexity_tyou.pptx
12/12 inada chapter6.6-6.10 *Theory of Computational Complexity_inada.pdf *Theory of Computational Complexity_inada.pptx
12/26 cheng chapter7.1-7.2 *Theory of Computational Complexity_Cheng.pdf
1/23 Lee minseon chapter7.3-7.6 *Theory of Computational Complexity_LeeMinseon.pptx

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 Mitzenmacher and Eli Upfal, "Probability and Computing: Randomized Algorithms and Probabilistic Analysis," Cambridge University Press, 2005.

Link