Searching for "Probabilistic Communication Complexity." – sorted by Relevance.
55 documents found, showing 1 through 10.
Next 10 →
-
Fourier Analysis For Probabilistic Communication Complexity
- …FOURIER ANALYSIS FOR PROBABILISTIC COMMUNICATION COMPLEXITY Ran Raz Abstract. We use Fourier…
- Cited by 15 (2 self) – Add To MetaCart
-
Probabilistic Communication Complexity of Boolean Relations
- …Probabilistic Communication Complexity of Boolean Relations Ran Raz Hebrew University Avi Wigderson…
- Cited by 21 (6 self) – Add To MetaCart
-
Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
- … Bits from Sources of Weak Randomness and Probabilistic Communication Complexity (Abstract…
- Cited by 140 (5 self) – Add To MetaCart
-
A Linear Lower Bound on the Unbounded Error Probabilistic Communication Complexity
- …A Linear Lower Bound on the Unbounded Error Probabilistic Communication Complexity Jurgen Forster…
- Cited by 22 (0 self) – Add To MetaCart
-
Lower Bounds for One-way Probabilistic Communication Complexity
- …), 196-200. H. Paturi and J. Simon, Probabilistic Communication Complexity, Journal of Computer…
- Cited by 20 (2 self) – Add To MetaCart
-
Exponential Separation of Quantum and Classical Communication Complexity
- … such that: 1. The quantum communication complexity of P is O(log m). 2. The classical probabilistic…
- Cited by 47 (1 self) – Add To MetaCart
-
Quantum Entanglement and Communication Complexity
- … particular two-party probabilistic communication complexity problem, quantum entanglement results in less…
- Add To MetaCart
-
BRICS Report Series RS-97-40 ISSN 0909-0878 December 1997
- … particular two-party probabilistic communication complexity problem, quantum entanglement results in less…
- Add To MetaCart
-
The Quantum Communication Complexity of Sampling
- … in probabilistic and quantum algorithms. In the spirit of communication complexity, given a function f : X Y…
- Cited by 40 (3 self) – Add To MetaCart
-
One-Way Communication Complexity And The Neciporuk Lower Bound on Formula Size
- … between probabilistic communication complexity with public and with private random bits is actually only…
- Cited by 5 (0 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
