hw2 - M ( x ) accepts, the correct result f ( x ) is...

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

View Full Document Right Arrow Icon
University of Maryland CMSC652 — Complexity Theory Professor Jonathan Katz Homework 2 Due at the beginning of class on Sept. 28 I suggest to use L A T E Xwhen typing up your solutions. 1. An undirected graph G can be k -colored if each of its vertices can be assigned a “color” in { 1 ,...,k } such that no vertices that share an edge have the same color. Let 3COL = { G : G can be 3-colored } . Prove that 3COL is NP -complete. 2. Let L be an NP -complete language. Prove that if L co NP then NP = co NP . 3. Prove that Definition 4.19 (the certificate-based definition) yields the same class NL as the definition of NL based on non-deterministic Turing machines. 4. A non-deterministic machine M computes a function f : { 0 , 1 } * → { 0 , 1 } * if the following holds: For every x , there exists a computation path such that M ( x ) accepts. In any computation path on which
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: M ( x ) accepts, the correct result f ( x ) is written on the output tape when M halts. (On computation paths where M ( x ) does not accept, anything may be written on the output tape.) Answer the following questions: (a) Let f ( G,s,t ) be the function that outputs a path from s to t in directed graph G (or if there is no path). Show that f can be computed by a non-deterministic log-space machine. (b) Show that f can be computed by a deterministic machine in space O (log 2 n ). (c) Show that any function that can be computed by a non-deterministic machine in space s ( n ) can be computed by a deterministic machine in space O ( s ( n ) 2 ). 5. Barak-Arora, Exercise 4.5. ( Hint : reduce 2SAT to conn .) 1...
View Full Document

This note was uploaded on 01/13/2012 for the course CMSC 652 taught by Professor Staff during the Fall '08 term at Maryland.

Ask a homework question - tutors are online