71 citations · 455 across the 36 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
cs.CC2009
Depth-Independent Lower bounds on the Communication Complexity of Read-Once Boolean Formulas
Rahul Jain, Hartmut Klauck, Shengyu Zhang
We show lower bounds of and on the randomized and quantum communication complexity, respectively, of all -variable read-once Boolean formulas. Our res…
quant-ph2009
On the power of a unique quantum witness
Rahul Jain, Iordanis Kerenidis, Greg Kuperberg +3
In a celebrated paper, Valiant and Vazirani raised the question of whether the difficulty of NP-complete problems was due to the wide variation of the number of witnesses of their…