MATHEMATICS 104 - Computational Complexity

Institution:

George Washington University

Subject:

Description:

Harizanov 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. Prerequisite: Math 71 or permission of instructor.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.gwu.edu

Phone Number:

(202) 994-1000

Regional Accreditation:

Middle States Association of Colleges and Schools

Calendar System:

Semester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.