1 Computational Complexity CPSC 468/568, Fall 2009 Time: Tu & Th, 2:30-3:45 pm Room: AKW 307 Satisfies the QR requirement. .

1

Computational Complexity

CPSC 468/568, Fall 2009Time: Tu & Th, 2:30-3:45 pmRoom: AKW 307

Satisfies the QR requirement.

http://zoo.cs.yale.edu/classes/cs468

2

Partial Topic Outline

• Complexity classes (P, NP, L, NL, etc.)• Reductions and completeness• The roles of, e.g.,

– Randomness– Interaction– Approximation

? Communication complexity

3

Requirements

• Modest reading assignments, mostly in Arora and Barak, Computational Complexity: A Modern Approach, Cambridge Univ. Press, 2009.

• 6 Written HW Assignments, each worth 10% of the course grade

• 2 In-Class Exams, each worth 20% of the course grade

• No final exam during exam week

4

Schedule

Sept. 17: First HW Assignment DueOct. 1: Second HW Assignment DueOct. 13: Third HW Assignment DueOct. 15: First In-Class ExamOct. 23: Fall Semester Drop DateOct. 29: Fourth HW Assignment DueNov. 17: Fifth HW Assignment DueDec. 1: Sixth HW Assignment Due Dec. 3: Second In-Class Exam

5

Rules and Guidelines

• Deadlines are firm.• Late penalty: 5% per day. • Announcements and assignments will be

posted on the class webpage (as well as conveyed in class).

• No “collaboration” on homeworks unless you are told otherwise.

• Pick up your graded homeworks and exams promptly, and tell the TA promptly if one is missing.

6

Instructor: Joan FeigenbaumOffice: AKW 512Office Hours: Thursdays 11:30 am - 12:30

pm and by appointment

Phone: 203-432-6432Assistant: Judi Paige([email protected], 203-436-1267,

AKW 507a, 8:30 am – 4:30 pm M-F)

Note: Do not send email to Professor Feigenbaum, who suffers from RSI. Contact her through Ms. Paige or the TA.

7

TA: David CostanzoOffice: AKW 301Email: [email protected] Hours: TBD

8

If you’re undecided …

Check out:• zoo.cs.yale.edu/classes/cs468/spr07/,

…/fall07/, and …/fall08• www.cs.princeton.edu/theory/complexity/ (draft of textbook by Sanjeev Arora and Boaz

Barak of Princeton)• www.cs.berkeley.edu/~luca/cs278-02/ (a complexity-theory course taught by Luca

Trevisan at Berkeley in 2002)• www.cs.lth.se/home/Rolf_Karlsson/bk/retro.pdf (“NP-Completeness: A Retrospective,” by

Christos Papadimitriou, 1997 International Colloquium on Automata, Languages, and Programming)

9

Questions?

10

Introduction to Complexity Classes

11

Computational Complexity Themes

•“Easy” vs. “Hard”•Reductions (Equivalence)

•Provability•Randomness

12

Poly-Time Solvable

• Nontrivial Example : Matching

13

Poly-Time Solvable• Nontrivial Example : Matching

14

Poly-Time Verifiable• Trivial Example : Hamiltonian Cycle

15

Poly-Time Verifiable• Trivial Ex. : Hamiltonian Cycle

16

•Is it Easier to Verify a Proof than to Find one?

•Fundamental Conjecture of Computational Complexity:

PNP

17

• Matching:

• HC:

Fundamentally Different

Distinctions

18

Reduction of B to A

•If A is “Easy”, then B is, too.

BAlgorith

m

A “oracle”

“black box”

19

•NP-completeness•P-time reduction•Cook’s theorem

If B ε NP, thenB ≤ P-time SAT

•HC is NP-complete

20

Equivalence

•NP-complete problems are an equivalence Class under polynomial-time reductions.

•10k’s problems•Diverse fields

Math, CS, Engineering, Economics, Physical Sci., Geography, Politics…

21

NP coNP

P

22

Random poly-time Solvable

x ε L?

poly-time Algorithm

xr

YES

NO

x ε {0,1}n

r ε {0,1}poly(n)

23

Probabilistic Classes

x ε L “yes” w.p. ¾

x L “no” w.p. 1

x ε L “yes” w.p. 1

x L “no” w.p. ¾

RP

coRP

(Outdated) Nontrivial ResultPRIMES ε ZPP ( = RP ∩ coRP)

24

Two-sided Error

BPPx L “yes” w.p. ¾x L “no” w.p. ¾

Question to Audience: BPP set not known to be in RP or coRP?

25

RP coRPZPP

NP coNP

P

26

Interactive Provability

P V [PPT, ¢]

x

yes/no

27

L ε IP•x ε L P: “yes” w.p. ¾•x L P*: “no” w.p. ¾

Nontrivial Result

Interactively Provable

Poly-Space Solvable

28

PSPACE

RP coRPZPP

NP coNP

P

29

PSPACE

EXP

P#P

PH

iP

2P

NP

P