Date of Award
6-1-2009
Document Type
Thesis (Undergraduate)
Department or Program
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.
Recommended Citation
Henderson-Frost, William B., "An Information Complexity Approach to the Inner Product Problem" (2009). Dartmouth College Undergraduate Theses. 58.
https://digitalcommons.dartmouth.edu/senior_theses/58
Comments
Originally posted in the Dartmouth College Computer Science Technical Report Series, number TR2009-646.