Simon Fraser University
Engaging the World

Course Outlines

Fall 2017 - CMPT 407 D100

Computational Complexity (3)

Class Number: 7086

Delivery Method: In Person

Overview

  • Course Times + Location:

    Sep 5 – Dec 4, 2017: Mon, Wed, Fri, 10:30–11:20 a.m.
    Burnaby

  • Exam Times + Location:

    Dec 6, 2017
    Wed, 8:30–11:30 a.m.
    Burnaby

  • Prerequisites:

    CMPT 307.

Description

CALENDAR DESCRIPTION:

Machine models and their equivalences, complexity classes, separation theorems, reductions, Cook's theorem, NP-completeness, the polynomial time hierarchy, boolean circuit models and parallel complexity theory, other topics of interest to the students and instructor.

COURSE DETAILS:

Please note this course is cross-listed with CMPT 710

The main goal of Complexity Theory is to answer the question: What can be efficiently computed given limited resources? This is a more "practical" version of the main question of Computability Theory: What can be computed? In this course, we will see a rich landscape of complexity classes that are used to characterize problems according to the required resources (such as time, space, randomness, parallelism). We will discuss some known and conjectured relationships among these classes, obtaining a detailed map of the complexity world. Proving the correctness of this map would involve solving some of the deepest open problems in computer science, including the famous "P vs NP" question.

Topics

  • Time and Space Complexity Classes, Nondeterminism
  • Nonuniformity and Circuit Complexity
  • Randomness
  • Alternation and the Polynomial-Time Hierarchy
  • Interactive Proofs
  • Counting Classes
  • Relativization and Natural Proofs
  • Probabilistically Checkable Proofs
  • Current frontiers in Complexity Theory
  • Quantum Computing

Grading

NOTES:

To be discussed in the first week of classes.

Materials

MATERIALS + SUPPLIES:

Reference Books

  • Computational Complexity, Christos H. Papadimitriou, Addison Wesley, 1995, 9780201530827

REQUIRED READING:

Computational Complexity: A Modern Approach
S. Arora and B. Barak
Cambridge
ISBN: 9780521424264

RECOMMENDED READING:

Introduction to the Theory of Computation
Mike Sipser
Cengage Learning, 2012, 3rd Edition
ISBN: 9781133187790

Registrar Notes:

SFU’s Academic Integrity web site http://students.sfu.ca/academicintegrity.html is filled with information on what is meant by academic dishonesty, where you can find resources to help with your studies and the consequences of cheating.  Check out the site for more information and videos that help explain the issues in plain English.

Each student is responsible for his or her conduct as it affects the University community.  Academic dishonesty, in whatever form, is ultimately destructive of the values of the University. Furthermore, it is unfair and discouraging to the majority of students who pursue their studies honestly. Scholarly integrity is required of all members of the University. http://www.sfu.ca/policies/gazette/student/s10-01.html

ACADEMIC INTEGRITY: YOUR WORK, YOUR SUCCESS