Information Complexity versus Corruption and Applications to Orthogonality and Gap-Hamming

@inproceedings{Chakrabarti2012InformationCV,
  title={Information Complexity versus Corruption and Applications to Orthogonality and Gap-Hamming},
  author={Amit Chakrabarti and Ranganath Kondapally and Zhenghui Wang},
  booktitle={APPROX-RANDOM},
  year={2012}
}
Three decades of research in communication complexity have led to the invention of a number of techniques to lower bound randomized communication comple xity. The majority of these techniques involve properties of large submatrices (rectangles) of th e truth-table matrix defining a communication problem. The only technique that does not quite fit is inf ormation complexity, which has been investigated over the last decade. Here, we connect informa tion complexity to one of the most powerful… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS

Similar Papers

Loading similar papers…