activity
20002005
most citedA direct sum theorem in communication complexity via message compression

23 citations · 36 across the 5 of their papers we have counts for

collaborators
Showing 2001 · cs.DMShow all

1 paper · 2 filters

cs.DM2001

Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem

Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan

We consider the problem of computing the second elementary symmetric polynomial S^2_n(X) using depth-three arithmetic circuits of the form "sum of products of linear forms". We con…