hwk2 - CSE 200 Computability and Complexity Homework 2 NP,...

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

View Full Document Right Arrow Icon
CSE 200 Computability and Complexity Homework 2 NP, Completeness, and Reductions Due Monday, May 10 April 26, 2010 Give proofs for each problem. Proofs can be high-level, but be precise. You may use without giving a proof any result proved in class or in the textbook. In particular, to prove NP-completeness, it suFces to give a reduction from any of the NP-complete problems from the text or from class. However, you must show your reduction is valid, by showing the equivalence of the constructed instance and the original. Restricted 3-SAT Show that the 3-SAT problem remains NP -complete when restricted to formulas where each variable appears at most 3 times. (Hint: remember that you can use smaller clauses than size 3.) Independent Set Maximality (ISM) Prove that the following problem is NP -complete. Given a graph G and an independent set I in G , is there a larger independent set I 0 , | I | < | I 0 | ? Abstract tiling Consider the abstract tiling problem shown non-computable in class, but
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/13/2012 for the course CSE 4111 taught by Professor Edmonds during the Winter '12 term at York University.

Page1 / 2

hwk2 - CSE 200 Computability and Complexity Homework 2 NP,...

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

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