COT 6410: Computational Complexity (Fall 2008)
Class Meeting Time: Tu/Th 7:30PM - 8:45PM HEC 302 Class Meeting Dates: 8/25/2008 - 12/13/2008
Notice
Notice (2008-08-25)
Notice (2008-09-30)
Notice (2008-10-07)
Notice (2008-11-05)
Assignments
Assignment 1: We have seen several (about six) interpretations of Non-determinism, describe each one and expalin it is a valid interpretation. Important points, i.e why it is interesting and what it tells us.
Assignment 2: Discuss Cook's Theorem. Due Tu Sep 30 2008
Extra Credit
Additional Materials and Resources Course Syllabus: Syllabus.doc Computational Complexity (I): Computational Complexity I.PPT Halting_Problem: Halting_Problem.doc 3SAT-->3DM: 3SAT-->3DM.doc NEW NOTES(1):Computational Complexity (1).ppt NEW NOTES(2):Computational Complexity (2).ppt
Presentations on NP-Complete Problems
Quantifying Customer Value(QCV.ppt), by Brian Williamson Real World NPC Problems(RWNPC.ppt) by Jonathan Cazalas and Tracy Bierman RNA Structure Edit Distance(RNA.ppt) by Cuncong Zhong Data Clean(DataClean.ppt) by Thomas Jones Partition(Strokes Segmentation Problem.ppt) by Shirley D. Marinkas & Yiyang Xiong Point of interest coverage(Point.ppt by Chris Ellis Community Structure Detection(CSD.ppt) by Mahadevan Vasudevan Multiple Sequence Alginment (MSA.ppt) by Yuan Li
Presentations on Computational Models Register Machine(RegisterMachines.ppt), by Jonathan Cazalas Factor Replacement System(FRS.ppt), by Huy Truong Primitive Recursive (Recursive.ppt), by Williamson Brian RM <= FRS (registerFactor.ppt), by Chris Ellis and Bruce Meeks, Jr. FRS <= PR (factorRecursive.ppt), by Thomas & Tracy PR <= TM (recursiveTuring.ppt), by Cuncong Zhong & Yuan Li
|