 |
CS 670 - Theory of Computation 2
Computability and decidability; introduction to the theory of computational complexity; the classes sP and NP; NP-completeness; examples of some NP-complete problems; nondeterminism and parallel computation; proving the correctness of programs. Prerequisite: CS 570. College: Sciences and Humanities Hours: 3 Permission: Y Prerequisite: CS 570 Co-requisite: none |
Copyright © 2012 Ball State University 2000 W. University
Ave. Muncie, IN 47306