Advanced Algorithms CSE 706, (2012 spring)


Instructor: Dr. M. Sakalli.

 

Lecture notes:

Feb 27, March 6. Lect Notes 1 on Computability.

Class materials.

Computability and Complexity.

Turing Machine. Ch 22 of a book addressed from stanford.

Computability and complexity of Neil Jones.

NP-NPC. of Prof Jeff Erickson of uiuc.

VC and IS proof and reduction of SAT, that I mentioned during the last lecture I also used Chapter 9 as well, for NP-completeness, by S. Skiena.

My notes 1, and VC and IS My notes with some other resources to give you a view..

 

Two additional books of combinatorial data analysis

a) Combinatorial data analysis for optimization by DP, by Lawrence Hubert, Phipps Arabie, and Jacqueline Meulma

b) Combinatoiral optimization, Kreher D.L., and Stinson D.R, 1999

 

Other course materials.

Projects Turing machine simulations, BB(k), and Turmite and game of life (conway).

Swarm algorithms.