lec3 - CS151 Complexity Theory Lecture 3 April 5, 2011...

Info iconThis preview shows pages 1–14. Sign up to view the full content.

View Full Document Right Arrow Icon
CS151 Complexity Theory Lecture 3 April 5, 2011
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
April 5, 2011 2 Summary Remaining TM details: big-oh necessary. First complexity classes: L, P, PSPACE, EXP First separations (via simulation and diagonalization): P EXP , L PSPACE First major open questions: L = P P = PSPACE First complete problems: CVAL is P -complete Succinct CVAL is EXP -complete ? ?
Background image of page 2
April 5, 2011 3 Summary EXP PSPACE P L
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
April 5, 2011 4 Nondeterminism: introduction A motivating question: Can computers replace mathematicians? L = { (x, 1 k ) : statement x has a proof of length at most k }
Background image of page 4
April 5, 2011 5 Nondeterminism: introduction Outline: nondeterminism nondeterministic time classes NP , NP -completeness, P vs. NP coNP NTIME Hierarchy Ladner’s Theorem
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
April 5, 2011 6 Nondeterminism Recall deterministic TM Q finite set of states alphabet including blank: “_” q start , q accept , q reject in Q transition function: δ : Q x ∑ ! Q x ∑ x {L, R, -}
Background image of page 6
April 5, 2011 7 Nondeterminism nondeterministic Turing Machine: Q finite set of states alphabet including blank: “_” q start , q accept , q reject in Q transition relation (Q x ∑) x (Q x ∑ x {L, R, -}) given current state and symbol scanned, several choices of what to do next.
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
April 5, 2011 8 Nondeterminism deterministic TM: given current configuration, unique next configuration nondeterministic TM: given current configuration, several possible next configurations q s ta rt x 1 x 2 x 3 …x n q s ta rt x 1 x 2 x 3 …x n q a c c e pt q re je c t x   L   L
Background image of page 8
April 5, 2011 9 Nondeterminism asymmetric accept/reject criterion q s ta rt x 1 x 2 x 3 …x n q s ta rt x 1 x 2 x 3 …x n q a c c e pt q re je c t   L   L “g ue s s ” “c o m puta tio n  pa th”
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
April 5, 2011 10 Nondeterminism all paths terminate time used : maximum length of paths from root space used : maximum # of work tape squares touched on any path from root
Background image of page 10
April 5, 2011 11 Nondeterminism NTIME(f(n)) = languages decidable by a multi-tape NTM that runs for at most f(n) steps on any computation path , where n is the input length, and f : N ! N NSPACE(f(n)) = languages decidable by a multi-tape NTM that touches at most f(n) squares of its work tapes along any computation path , where n is the input length, and f : N ! N
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
April 5, 2011 12 Nondeterminism Focus on time classes first: NP = k NTIME(n k ) NEXP = k NTIME(2 n k )
Background image of page 12
April 5, 2011 13 Poly-time verifiers Very useful alternate definition of NP: Theorem : language L is in NP if and only if it is expressible as: L = { x| 9 y, |y| ≤ |x| k , (x, y) R } where R is a language in P.
Background image of page 13

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 14
This is the end of the preview. Sign up to access the rest of the document.

This document was uploaded on 01/05/2012.

Page1 / 52

lec3 - CS151 Complexity Theory Lecture 3 April 5, 2011...

This preview shows document pages 1 - 14. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online