Homework 7
Due 2012/12/10
Fall 2012
Analytical Methods in CS
Oded Regev
Courant Institute
1. Stronger KKL theorem: Prove the following strengthening of the KKL theorem. There exists a c > 0
such that
Fall 2012
Analytical Methods in CS
Homework 6
Due 2012/11/19
Oded Regev
Courant Institute
1. Total inuence of DNFs:
(a) Assume f can be expressed as a DNF of width w (i.e., each clause has at most
w l
Fall 2012
Analytical Methods in CS
Homework 5
Due 2012/11/12
Oded Regev
Courant Institute
1. Learning juntas with queries: Show an algorithm for exactly learning k-juntas in time poly(n, 2k )
using qu
Fall 2012
Analytical Methods in CS
Homework 4
Due 2012/10/29
Oded Regev
Courant Institute
Solve at least two out of the three questions (or all three for extra credit).
1. A hardness reduction that fa
Fall 2012
Analytical Methods in CS
Homework 3
Due 2012/10/22
Oded Regev
Courant Institute
1. Tribes function: For any k, l we dene the tribes function f : cfw_0, 1n cfw_1, 1 on
n = kl variables as
f (
Fall 2012
Analytical Methods in CS
Homework 2
Due 2012/10/8
Oded Regev
Courant Institute
1. Poincar inequality: Let f : cfw_0, 1n cfw_1, 1. Show that
e
Var( f ) = 4 Pr[ f ( x ) = 1] Pr[ f ( x ) = 1],
Fall 2012
Analytical Methods in CS
Homework 1
Due 2012/10/1
Oded Regev
Courant Institute
Instructions
References: Try not to run to reference material to answer questions (this also includes the web!)
Analytical Methods
1
Friedgut and KKL
Lemma 1.1. For any f : cfw_0, 1n cfw_1, 1, 0 1,
Infi ( f ) =
|S| f(S)2 (Infi ( f )
2/(1+)
Si
Remarks:
Small inuence gets much smaller after noise
Not a Fourier