Homework 1 Complexity and Advanced Algorithms

Due August 7, 2013.

Note that all homeworks are DUE at the beginning of the class of the due date. You must be present in the class to submit your homework. Homeworks submitted otherwise will not be accepted/graded. Problem 1. Design a TM/Linear Bounded Automata for computing the following functions. f (n) = 2n f (n) = n2 . (2 2= 4 Points) Problem 2. Consider the language Ln = {w|w {0, 1} , w n and, w is a prime number}. Is L regular? Justify your answer. (4 Points) Problem 3. Dene a directed graph on n vertices that has the following properties. Your denition should hold for a countably innite set of values for n. There are two vertices u and v such that the number of directed paths from u to v is exponential in n. The graph has exactly two directed paths between ever pair of vertices. (2 2 = 4 Points) Problem 4. Show that the following two denitions of the class NP are identical. 1. A language L is in NP if there exists a non-determinisitc Turing machine M such that M decides whether x L in O(p(|x|) steps. 2. A language L is in NP if there exists a polynomial time decidable relation RL such that for every x L, there exists a string y {0, 1} with |y | = p(|x|) and (x, y ) RL . In the above, p() is a polynomial and |x| is the length of the string x. (4 Points)