トップ 一覧 検索 ヘルプ RSS ログイン

2011年度計算量理論の変更点

  • 追加された行はこのように表示されます。
  • 削除された行はこのように表示されます。
This is page of "Theory of Computational Complexity 2011"

From 2011/10/1〜

aaa!Part
!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,*{{ref Theory of Computational Complexity_sakaidani.pdf}}, *{{ref Theory of Computational Complexity_sakaidani.pptx}}
,10/17,sasanuma,chapter1.4-2.3,*{{ref Theory of Computational Complexity_sasanuma.pdf}}, *{{ref Theory of Computational Complexity_sasanuma.pptx}}
,10/24,ZHU,chapter2.4-3.3,*{{ref zhu ao rinkou.docx}}, *{{ref zhu ao_rinkou.ppt}}
,10/31,Tarek,chapter3.4-4.6,*{{ref Theory of Computational Complexity_Tarek.pdf}}
,11/7,inoshita,chapter5.1-5.4,*{{ref Theory of Computational Complexity_inoshita.pdf}}, *{{ref Theory of Computational Complexity_inoshita.pptx}} 
,11/21,furukawa,chapter5.5-5.8,*{{ref Theory of Computational Complexity_furukawa.pdf}}, *{{ref Theory of Computational Complexity_furukawa.pptx}}
,11/28,tyou,chapter6.1-6.5,*{{ref Theory of Computational Complexity_tyou.pptx}}
,12/12,inada,chapter6.6-6.10,*{{ref Theory of Computational Complexity_inada.pdf}}, *{{ref Theory of Computational Complexity_inada.pptx}}
,12/26,cheng,chapter7.1-7.2,*{{ref Theory of Computational Complexity_Cheng.pdf}}
,1/23,Lee minseon,chapter7.3-7.6,*{{ref Theory of Computational Complexity_LeeMinseon.pptx}}


// この行はコメント
// ,9/1,川原,0.0章,*{{ref slide.ppt}}
// のようにして書いてください。

The marked(*) slides are under the application of [NYSDL|http://www.kmonos.net/nysl/nysdl.ja.html] 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
*[Probability and Computing (pdf)|http://www.cs.cmu.edu/~odonnell/papers/probability-and-computing-lecture-notes.pdf] by Ryan O'donnell
*[Randomized Algorithms and Probabilistic Analysis|http://www.cs.washington.edu/homes/jrl/cs525/] by James R Lee
*[Randomized Algorithms|http://www.cs.cmu.edu/afs/cs/usr/avrim/www/Randalgs11/index.html] by Avrim Blum and Anupam Gupta
*[Randomized Algorithms|http://courses.csail.mit.edu/6.856/] by David R. Karger
*[Randomized Algorithms|http://www.cs.berkeley.edu/~luca/cs174/] by Luca Trevisan
*[セミナーの準備のしかたについて|http://www.ms.u-tokyo.ac.jp/%7Eyasuyuki/sem.htm]
*[岩間研究室 輪講のページ|http://www.lab2.kuis.kyoto-u.ac.jp/fswikiout/wiki.cgi?page=%B4%E4%B4%D6%B8%A6%B5%E6%BC%BC%A1%A1%CE%D8%B9%D6%A4%CE%A5%DA%A1%BC%A5%B8]