計算理論(Computation Theory)

評分:課堂抽考20% 作業20% 期中考30% 期末考30%

各次考試與作業成績 

參考用書:

Programs, Machines and Computation: An Introduction to the Theory of Computing (out of print)
Authors: Keith Clark and Don Cowell
Publisher: McGraw-Hill Companies
Elements of the Theory of Computation, 2/E
Authors: Harry R. Lewis, Christos H. Papadimitriou and Christos Papadimitriou
Publisher: Prentice Hall
Introduction to Automata Theory, Languages, and Computation, 2/E
Authors: John E. Hopcroft, Rajeev Motwani and Jeffrey D. Ullman
Publisher: Addison-Wesley
An Introduction to Formal Languages and Automata, 3/E
Author: Peter Linz
Publisher: Jones and Bartlett

修課學生名單:HTML EXCEL

公佈事項:

日期
講義
作業
05/05/26  

Show that if TSP is in P then TSPF is polynomial time solvable.

繳交期限:六月十四日

05/05/03
05/04/29  

Lecture5已公佈之作業
繳交期限:五月四日

05/04/20
05/04/11  

Lecture3作業及Lecture4作業
繳交期限:四月十九日

05/03/30

作業,隨堂測驗成績(2005/04/06更新)

如有疑問請email至hsunli.chang@gmail.com

作業1,2隨堂測驗1,2成績公佈

05/03/29
05/03/20  

Lecture2及部分Lecture3作業
繳交期限:三月廿八日

05/03/08
05/03/03  

Lecture1作業
繳交期限:三月七日

05/03/01
05/02/22
05/02/17

Back