CSCI 384 - Complexity Theory

FC NSMA QFR

4 credits
This is a sequel to CSCI 383: Theory of Computation. In CSCI 383 we map out the world in terms of what computers can and cannot do. In this course we classify problems based on the resources that are needed to solve them and how these resources relate to the needs of other problems. We will consider questions such as “How much time or memory does a computer need to solve a problem” “Does randomness help us solve problems faster?” and “If you don’t trust someone, what can they convince you of?”
Prerequisites & Notes: CSCI 280, and CSCI 383