COMP 4742

Computational Complexity

Lec 001 selected

Is an in-depth discussion of computational complexity theory. Topics covered in the course include: models of computation (for both serial and parallel computations); complexity measures; reducibility; complexity classes (NP, PSPACE, NC, LOGSPACE and P); and randomized computations.

Sections

Lecture

Lec 001

Mon, Wed, Fri 14:00-14:50

Mon, Wed, Fri14:00-14:50To be announced62604

Syllabus

Have the syllabus for COMP 4742? Share it and everyone gets the grading, textbooks and rules.