November 22

# November 22 - CSCI 2670 Introduction to Theory of Computing November22,2005 Agenda Lastweek Today TheClassP TheClassNP MoreontheclassNP Solving vs

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

CSCI 2670 Introduction to Theory of Computing November 22, 2005

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

View Full Document
November 22, 2005 Agenda Last week The Class P The Class NP Today More on the class NP
November 22, 2005 Solving vs. verifying What if we can’t  solve  the problem in O(n k ) time? Given a problem and a potential solution, can we  verify  the solution is correct?

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

View Full Document
November 22, 2005 Example The vertex cover problem Given a graph G = <V,E> and a number k in N, does  there exist a subset V’ of V such that |V’| = k For every (u,v) E, either u V’ or v V’
November 22, 2005 Vertex cover

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

View Full Document
November 22, 2005 The vertex cover problem There is no known polynomial solution to the  vertex cover problem What if we have a potential solution Can we verify it in O(n k ) time?
November 22, 2005 Verifier M accepts <V,E,k,V’> if and only if |V’| = k and  every edge in E has at least one endpoint in V’

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.

## This note was uploaded on 02/07/2011 for the course CS 501 taught by Professor Sm during the Spring '11 term at Indiana.

### Page1 / 13

November 22 - CSCI 2670 Introduction to Theory of Computing November22,2005 Agenda Lastweek Today TheClassP TheClassNP MoreontheclassNP Solving vs

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

View Full Document
Ask a homework question - tutors are online