MCS   265:   Theory of Computation
Spring 2005

Homework problems   Reading assignments, part 2
MCS-265 homepage
Homework guidelines Course Summary Prof. Barbara Kaiser


Reading assignments, April 4 - May 17

Date:
Section: Topic:
Due:
Feb. 7 - March 24 Assignments
 
 
 
April 4
 4.1
 Decidable  Langauges
 
April 5
 (re-read 2.1)
 Chomsky normal form; decidable questions with CFL
 
April 7
 
 cont.
 
April 8
 
 skip day
 
 
 
 
 
April 11
 4.2  Halting problem  
April 12
 
 cont.

April 14
 5.1  Undecidable problems  Hw5
April 15
 
 cont.
 
 
 
 
 
April 18
 
 cont.  
 April 19
 5.3 Mapping reducibility
 
April 21
cont.
 
April 22
 5.2 Post correspondence problem  Hw6
 
 
 
 
April 25
 
  Review/catch-up  
April 26
   Test #2  
April 28
7.1  Complexity, Big-O  notation  
April 29
  7.2  The class P  
 
 
 
 
May 2
 
 cont.
 
May 3
 7.3  The class NP  
May 5
 
 k-cliques, 3-cliques
 
May 6
 
 BK gone
 
 
 
 
 
May 9
 
 
 
May10  7.4  NP-completeness, polynomial time reducibility
 Hw7
May 12
 
 Satisfiability,  cliques
 
May 13
 
 Hamiltonian cycles
 
 
 
 
 
May 16
 
 Cook-Levin
 
May 17
 
 Review
 

 


Last modified: 4/18/5