Preview Workflow

A deleted record cannot be edited

Course Deactivation Proposal

Viewing: MATH 3740W : Computational Complexity

Last approved: Mon, 26 May 2014 08:37:25 GMT

Last edit: Thu, 15 May 2014 19:34:34 GMT

Programs referencing this course
Not offered
Columbian College of Arts and Sciences
Mathematics (MATH)
MATH
3740W
Computational Complexity
Computational Complexity
201403
3
Course Type
Lecture
Default Grading Method
Letter Grade

No
No
MATH 2971 or permission of instructor
Corequisites



Frequency of Offering

Term(s) Offered

Are there Course Equivalents?
No
 
Fee Type




Automata and languages. Deterministic and nondeterministic Turing machines. Space and time complexity measures and classes. The P versus NP problem. The traveling salesman problem and other NP-complete problems. Intractability. Circuit complexity. Introduction to probabilistic and quantum algorithms.

Uploaded a Course Syllabus

Course Attribute
CCAS - GCR: Q & L

Key: 4856