This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CSci 5403, Spring 2010 Homework 1 due: Feb 2, 2010 1. Constructibility. Recall that a function t : N → N is timeconstructible if there is a Turing Machine that computes the binary representation of t ( n ) given 1 n as input, in time O ( t ( n )). Suppose f and g are timeconstructible, and prove that the following are also timeconstructible: (a) f ( n ) + g ( n ) (b) f ( n ) × g ( n ) (c) f ( g ( n )) (d) 2 f ( n ) 2. Approximate Cuts. The maxcut problem is defined as follows. Given an undirected graph G = ( V,E ), a cut is a set of vertices S ⊂ V . The weight of the cut is the number of edges that cross between S and V \ S , i.e. wt G ( S ) =  E ∩ S × ( V \ S )  . The decision problem maxcut is defined by {h G,k i  G = ( V,E ) ∧∃ S ⊂ V.wt G ( S ) ≥ k } , and the search problem is to find a cut with weight max( G ) = max S ⊂ V wt G ( S ). It is possible to show that maxcut is NPhard. This question will explore randomized algorithms for the search problem. A randomized algorithm is one that can make indepen dent, unbiased coin flips. The output of the algorithm on any given input is thus a random variable, and we can perform the usual operations on random variables (computing func...
View
Full
Document
This note was uploaded on 10/21/2011 for the course CSCI 5403 taught by Professor Sturtivant,c during the Spring '08 term at Minnesota.
 Spring '08
 Sturtivant,C

Click to edit the document details