hw05 - CS 154 Intro. to Automata and Complexity Theory...

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: CS 154 Intro. to Automata and Complexity Theory Handout 21 Autumn 2009 David Dill November 3, 2009 Problem Set 5 Due: November 10, 2008 Homework: (Total 100 points) Do the following exercises. Problem 1. [20 points] Prove that the following problem, called 4TA-SAT, is NP-complete. The problem is defined as follows: INPUT: A boolean formula F ( X 1 ,X 2 ,... ,X n ). PROBLEM: Does F have at least 4 satisfying truth assignments? You should reduce the 3-SAT problem to 4TA-SAT. The answers to the following questions constitute the proof of NP-completeness. (a). Prove that 4TA-SAT is in NP. (b). Describe a polynomial-time reduction from 3-SAT to 4TA-SAT. Your reduction should take a 3-SAT formula F and construct an instance of the 4TA-SAT problem, say the formula G . ( Hint : Suppose you add a variable Y to the boolean formula F , but dont actually use it in any of the clauses. If F had k satisfying truth assignments originally, how many satisfying truth assignments will it have now?) (c). Show that F is satisfiable if and only if G has at least four satisfying truth assignments. Problem 2. [20 points] Prove that the following problem called DS (Dominating Set) is NP- complete. A dominating set in a graph G = ( V,E ) is a set of vertices...
View Full Document

This note was uploaded on 01/12/2010 for the course CS 154 at Stanford.

Page1 / 2

hw05 - CS 154 Intro. to Automata and Complexity Theory...

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