Average and randomized communication complexity
From MaRDI portal
Recommendations
- A characterization of average case communication complexity
- Randomized communication complexity of approximating Kolmogorov complexity
- Probabilistic communication complexity
- Communication Complexity and Quasi Randomness
- Average circuit depth and average communication complexity
- Communication Complexity
- Bounds on tradeoffs between randomness and communication complexity
- Average and Randomized Complexity of Distributed Problems
- On the complexity of communication complexity
Cited in
(16)- Communication protocols for secure distributed computation of binary functions.
- Randomized function evaluation on a ring
- Bounds on tradeoffs between randomness and communication complexity
- LATIN 2004: Theoretical Informatics
- A characterization of average case communication complexity
- A communication-randomness tradeoff for two-processor systems
- A comparison of two lower-bound methods for communication complexity
- Amortized Communication Complexity
- SVM via saddle point optimization: new bounds and distributed algorithms
- scientific article; zbMATH DE number 194098 (Why is no real title available?)
- Average and Randomized Complexity of Distributed Problems
- On a theorem of Razborov
- Randomized communication versus partition number
- Nondeterministic communication complexity of random Boolean functions (extended abstract)
- One-message statistical Zero-Knowledge Proofs and space-bounded verifier
- scientific article; zbMATH DE number 4055049 (Why is no real title available?)
This page was built for publication: Average and randomized communication complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3481627)
