%T An Information Complexity Approach to the Inner Product Problem
%A Amit Chakrabarti
%A William B. Henderson-Frost
%A Ranganath Kondapally
%R Technical Report TR2009-646
%I Dartmouth College, Computer Science
%C Hanover, NH
%D June 2009
%U http://www.cs.dartmouth.edu/reports/TR2009-646.pdf
%X
 We prove a lower bound of the randomized communication complexity of the inner product function on the uniform distribution.
%Z
 Senior Honors Thesis. Advisor: Amit Chakrabarti.