A deleted record cannot be edited
May 26, 2014 by Misrak Negatu (misrak)
Course Deactivation Proposal
MATH 3740W : Computational Complexity
Mon, 26 May 2014 08:37:25 GMT
Thu, 15 May 2014 19:34:34 GMT
Programs referencing this course
Reason for Termination
Columbian College of Arts and Sciences
Long Course Title
Short Course Title
Number of Credits
Default Grading Method
Repeatable for Credit?
MATH 2971 or permission of instructor
Frequency of Offering
Are there Course Equivalents?
Are Fees Applicable?
Explanation and Description of Fees
Are Additional Resources Required?
Explanation of Additional Resources
Justification for Additional Resources
Describe any Sources of Additional Funding
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
Explanation of how the course differs from similar GW courses
CCAS - GCR: Q & L
Course Reviewer Comments