reduction

reduction - Computer Science E-207 A Reduction 1....

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

View Full Document Right Arrow Icon

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

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

Unformatted text preview: Computer Science E-207 A Reduction 1. NP-completeness. A language L is said to be NP-complete iff L is in NP ; and L is NP-hard (i.e. every language in NP is reducible to L in polynomial time). To show L is in NP : Show that L has succinct certificates that can be nondeterministically guessed; and Give a polynomial time algorithm that checks the certificates. To show L is NP-hard: Choose a known NP-complete language L to reduce from. Reduce L to L . Show that the reduction can be done in polynomial time. What are some known NP-complete languages? Sat, 3-Sat, Integer Linear Programming, Vertex Cover, Clique, Independent Set . What should the reduction look like? We begin with a problem X and a known NP-complete problem X . We want to show that if we had some deterministic polynomial time algorithm for solving X , we could use it to solve X in deterministic polynomial time. To do this, we have to be able to transform every instance of the problem X into an instance of the problem...
View Full Document

Page1 / 2

reduction - Computer Science E-207 A Reduction 1....

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