Computer Science/Math 491A
Introduction to Complexity Theory

Title:   Introduction to Complexity Theory
Instructor:   Cezar Câmpeanu
Email:   ccampeanu < at > upei < dot > ca
Office:   CASS 408
Tel:   (902)566-0485
Course web site:  

Go To:,
Then follow the links: Faculty, Cezar Campeanu, Personal webpage, Teaching, and MCS491A under September 2016.

General description: This course introduces formal languages, computability, and complexity. Topics include: formal languages, computability, complexity related to various computability models
PREREQUISITE:   CS 261 and Math 242
ACADEMIC HONESTY:   This course is committed to the principle of academic integrity. Submitted work is expected to reflect an individual effort. Copying or cheating on assignments or tests will be dealt with harshly. Students should read Academic Regulation 20 in the UPEI Calendar at page 104 (
Avoiding Plagiarism:   The following link will help you identify and. avoid plagiarism
Individual Work Expectations:   You are expected to write your own code, your own proofs, your own examples, and so on. Unless explicitly specified in the assignment's text, the submitted work should be all yours.
Grading scheme:
Assignments Midterm Examination Final Project
35% 35% 30%
Course Resources:
  1. Assignments
  2. Handouts
  3. Tentative Schedule
  4. Moodle login
  5. Assignment Policy
To make sure you are viewing the most recent version of this page,press the shift key while clicking on the Reload button.
It is your responsibility to check this page for updates.

Last modified:Tuesday September 05, 2017 at 09:17 am ADT
Cezar Câmpeanu