Quick Course Search

AUCSC415 - Automata, Algorithms and Complexity

Models of computers, including finite automata and Turing machines, basics of formal languages, compatibility, algorithm optimality, complexity classes (p, NP, NPcomplete, EXP, PSPACE, etc.), probabilistic algorithms, approximation algorithms, number-theoretic and other selected algorithms, including selection and order statistics. Prerequisites: AUCSC 310. Notes: This course may not be taken for credit if credit has previously been received for AUCSC 315, 410, or AUMAT 355.

Winter Term 2018

Lecture Sections

Winter Term 2018 - LEC 1B01 (93441)

TR 10:15:00 - 11:45:00 (AU G 2 286)
Instructor: miyoung2@ualberta.ca - Profile

View Previous Terms