J an 2 01 2 A direct product theorem for bounded-round public-coin randomized communication complexity

  • Rahul Jain, Singapore Attila Pereszlényi
  • Published 2012
A strong direct product theorem for a problem in a given model of computation states that, in order to compute k instances of the problem, if we provide resource which is less than k times the resource required for computing one instance of the problem with constant success probability, then the probability of correctly computing all the k instances… CONTINUE READING