|
Nov 21, 2024
|
|
|
|
2017-2018 Catalog [ARCHIVED PUBLICATION] Use the dropdown above to select the current catalog.
|
MATH167 HM - Complexity Theory Credit(s): 3
Pippenger, Libeskind-Hadas (Computer Science), Bull (Pomona). Specific topics include finite automata, pushdown automata, Turing machines, and their corresponding languages and grammars; undecidability; complexity classes, reductions, and hierarchies. (Fall) (Crosslisted as CSCI142 HM )
Prerequisite(s): (CSCI060 HM or CSCI042 HM ) and MATH055 HM
|
|