192 citations · 482 across the 16 of their papers we have counts for
1 paper · 2 filters
Alexander Razborov
We completely (that is, up to a logarithmic factor) characterize the bounded-error quantum communication complexity of every predicate f(x,y) depending only on ∣x∩y∣ ($x,y\…