725-hw5-sp-06

725-hw5-sp-06 - satisfiable if and only if the original...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CSE 725 — Spring, 2006 Homework 5 Due: Wednesday, May 24 (start of class) 1. Do homework exercises 7.5, 7.7, and 7.17 from the textbook (both editions). 2. Complete the reduction SAT DP m p 3 SAT DP by showing how to convert a conjunct with exactly one literal to a 3-cnf formula and by showing how to convert a conjunct with exactly two literals to a 3-cnf formula. In both cases, the new formula must be
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: satisfiable if and only if the original formula is satisfiable. 3. Prove that CLIQUE DP m p VERTEX _ COVER DP . 4. Consider the function MAX_CLIQUE such that for any undirected graph G, MAX_CLIQUE( G ) = a list of vertices in a largest clique of G. Prove that CLIQUE DP P if and only if MAX_CLIQUE is computable in polynomial time....
View Full Document

This note was uploaded on 04/13/2010 for the course CSE 725 taught by Professor Long during the Spring '08 term at Ohio State.

Ask a homework question - tutors are online