Scribd
Upload
27 views

COS 522 Complexity - Homework 9.: Boaz Barak Total of 110 Points

This document outlines 6 exercises for a complexity theory homework assignment worth a total of 110 points. It includes exercises to: 1) Prove the Johnson Bound relating codeword distance and number of codewords within a given distance of a string. 2) Complete an exercise showing a relationship between polynomials and divisibility. 3) Use local list decoding and Goldreich-Levin to reduce worst-case to average-case circuit complexity. 4) Complete an exercise related to interactive proofs. 5) Complete a converse exercise related to complexity classes NEXP and MA. 6) Simplify a proof about complexity classes NEXP, P/poly, and EXP without using pseudorandom generators.

Uploaded by

MohammadChharchhodawala
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
27 views

COS 522 Complexity - Homework 9.: Boaz Barak Total of 110 Points

This document outlines 6 exercises for a complexity theory homework assignment worth a total of 110 points. It includes exercises to: 1) Prove the Johnson Bound relating codeword distance and number of codewords within a given distance of a string. 2) Complete an exercise showing a relationship between polynomials and divisibility. 3) Use local list decoding and Goldreich-Levin to reduce worst-case to average-case circuit complexity. 4) Complete an exercise related to interactive proofs. 5) Complete a converse exercise related to complexity classes NEXP and MA. 6) Simplify a proof about complexity classes NEXP, P/poly, and EXP without using pseudorandom generators.

Uploaded by

MohammadChharchhodawala
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

COS 522 Complexity Homework 9.

Boaz Barak

Total of 110 points

Exercise 1 (10 points). Prove the Johnson Bound: If C is a code of minimum distance 1/2 e

and > 10  then for every string h there are at most 10/ 2 distinct codewords in C of distance
at most 1/2 to h. (Hint: think of codewords as vectors in {1}n . Also the proof is in the book,
but I prefer if you first try to prove it yourself.)

Exercise 2 (20 points). Do Exercise 19.16 (Q(x, P (x)) 0 iff P (x) y divides Q(x, y))

Exercise 3 (40 points). Using the local list decoder for Reed Muller stated in Theorem 19.26,
and the Goldreich-Levin Theorem (that you proved in Homework 4), complete the proof of the
optimal worst-case to average-case reduction: show that there is a way to transform every function
f : {0, 1}n {0, 1} in 2O(n) time into a function f : {0, 1}O(n) {0, 1} such that if there exists
a circuit C of size S such that Prx [C(x)
= f(x)] 1/2 + 1/S then there exists a circuit C of size
S O(1) that computes f on every input in {0, 1}n

Exercise 4 (20 points). Do Exercise 20.8 (easy case of IW98)

Exercise 5 (30 points). Do Exercise 20.10 (converse to NEXP P/poly = NEXP = MA)

Exercise 6 (Open question, as far as I know - better than any points :)). Find a simpler proof
(maybe without using pseudorandom generators?) for the statement that if NEXP P/poly then
NEXP = EXP.

You might also like