NPComplete-handouts-2-2

# NPComplete-handouts-2-2 - NP-Completeness (Theorems and...

This preview shows pages 1–3. Sign up to view the full content.

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: NP-Completeness (Theorems and Thoughts)4/24/2006 2:47 PM1NP-Completeness1NP-Completeness (Theorems and Thoughts)x1x3x2x1x4x3x2x4111213212223313233NP-Completeness2TheoremA language L can be deterministically verified in polynomial time if and only if L can be nondeterministically accepted in polynomial timePart 1: If L can be nondeterministically accepted in polynomial time then L can be deterministically verified in polynomial timePart 2: If L can be deterministically verified in polynomial time then L can be nondeterministically accepted in polynomial time NP-Completeness (Theorems and Thoughts)4/24/2006 2:47 PM2NP-Completeness3Equivalence of the Two Definitions (Part 1)Suppose A is a non-deterministic algorithmLet y be a certificate consisting of all the outcomes of the choose steps that A usesWe can create a verification algorithm, B, that uses y instead of the choose steps of AIf A accepts x, then the certificate y allows us to verify this ultimately, using B If A runs in polynomial-time, so does BAAxChooseyiyesNP-Completeness4Equivalence of the Two Definitions (Part 1)(Part 1) Suppose A is a non-deterministic algorithmLet y be a certificate consisting of all the outcomes of the choose steps that A usesWe can create a verification algorithm, B, that uses y instead of the choose steps of AIf A accepts x, then the certificate y allows us to verify...
View Full Document

## This note was uploaded on 09/10/2009 for the course CS 401 taught by Professor Cs401 during the Spring '08 term at Illinois Tech.

### Page1 / 6

NPComplete-handouts-2-2 - NP-Completeness (Theorems and...

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

View Full Document
Ask a homework question - tutors are online