This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: – Task: Output a maximum sized clique of G – Decision Problem – Input: Graph G=(V,E), integer k ≤ |V| – Y/N Question: Does G contain a clique of size k? (5) (S19) Show that if we can solve the decision problem, we can solve optimization problem 1. (6) (S19) Show that if we can solve optimization problem 1, we can solve optimization problem 2. Take home review questions 1) What is the definition of complexity class P? 2) How do we prove a problem belongs to P? 3) How does a polynomial-time answer-preserving input transformation differ from the answer-preserving input transformations we studied in module 11?...
View Full Document
This note was uploaded on 07/25/2008 for the course CSE 460 taught by Professor Torng during the Fall '07 term at Michigan State University.
- Fall '07