Date of Award

6-1-2009

Document Type

Thesis (Undergraduate)

Department

Department of Computer Science

First Advisor

Amit Chakrabarti

Abstract

We prove a lower bound of the randomized communication complexity of the inner product function on the uniform distribution.

Comments

Originally posted in the Dartmouth College Computer Science Technical Report Series, number TR2009-646.

Share

COinS