# review3 - Computer Science 340 Reasoning about Computation...

• Homework Help
• PresidentHackerCaribou10582
• 1

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

Computer Science 340 Reasoning about Computation Review Session 3 Monday, January 14, 2008 Problem 1 An algebraic number is a complex number that is a root of a polynomial with integer coefficients. Is the set of algebraic numbers countable ? Problem 2 A useless state in a Turing Machine is one that is never entered on any input string. Consider the problem of testing whether a Turing machine has any useless states. Formulate this problem as a language and show that it is undecidable. Problem 3 In the Exactly-one 3SAT problem, we are given a 3CNF formula φ , and need to decide if there exists a satisfying assignment such that every clause of
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: φ has exactly one True literal. Show that Exactly-one 3SAT is NP-complete. Problem 4 In the MAX CUT problem, we are given an undirected graph G , an integer K and have to decide where there is a subset of vertices S such that there are at least K edges that have one endpoint in S and one endpoint in S . Prove that this problem is NP-complete by giving a reduction from the following variant of 3SAT which is known to be NP-complete: In the Not-All-Equal SAT problem, we are given a 3CNF formula φ and need to decide if there exists a satisfying assignment such that every clause of φ has one or two True literals....
View Full Document

• Fall '07
• CharikarandChazelle
• Computer Science, satisfying assignment, Computation Review Session

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern