November 22

November 22 - CSCI 2670 Introduction to Theory of Computing...

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

View Full Document Right Arrow Icon
1 CSCI 2670 Introduction to Theory of Computing November 22, 2005 November 22, 2005 Agenda •Last week –The C lass P –The C lass NP •Today – More on the class NP November 22, 2005 Solving vs. verifying • What if we can’t solve the problem in O(n
Background image of page 1

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

View Full DocumentRight Arrow Icon
2 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 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
Background image of page 2
3 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’ Computational complexity?
Background image of page 3

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

View Full DocumentRight Arrow Icon
Image of page 4
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 / 5

November 22 - CSCI 2670 Introduction to Theory of Computing...

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

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