back to classes

CS486/586 Computability and Intractability

Winter 2012

cs486 website: http://www.calstatela.edu/faculty/vcrespi/CS/CS486/Lects/cs486.html
Lectures:

MW 1:30-3:10pm, ET A-210

Final Exam:

TBA

Instructor:

Valentino Crespi
vcrespi@calstatela.edu
(323) 343-4596.
ET-A318

Office Hours:

TR 4:30-5:50pm, ET-A318.

Course Description: Theory of Computing; nondeterminisms, decidability and unsolvable problems; NP completeness and intractable computations.
Prerequisites: MATH 386: Introduction to Automata Theory.
Full Syllabus: CS486-Instructor-Syllabus-Winter-2012.pdf