Search Results

MATH 3740. Computational Complexity. 3 Credits.

Automata and languages; deterministic and nondeterministic Turing machines; space and time complexity measures and classes; P-versus-NP problem; traveling salesman problem and other NP-complete problems; intractability; circuit complexity; introduction to probabilistic and quantum algorithms. Prerequisites: MATH 2971 or MATH 2971W.

Master of Science in the Field of Applied Mathematics

...Logic , MATH 3720 Axiomatic Set Theory , MATH 3730 Computability Theory , MATH 3740 Computational Complexity , MATH...