Randomized communication versus partition number
From MaRDI portal
Recommendations
Cited in
(18)- Communication complexity with small advantage
- Partition Information and its Transmission Over Boolean Multi-Access Channels
- Randomised Broadcasting: Memory vs. Randomness
- Clique problem, cutting plane proofs and communication complexity
- Deterministic communication vs. partition number
- Rényi information complexity and an information theoretic characterization of the partition bound
- Low-sensitivity functions from unambiguous certificates
- scientific article; zbMATH DE number 7204504 (Why is no real title available?)
- Query-to-communication lifting for BPP
- scientific article; zbMATH DE number 7758330 (Why is no real title available?)
- scientific article; zbMATH DE number 7706048 (Why is no real title available?)
- The power of many samples in query complexity
- Randomized query composition and sabotage complexity
- Separations between combinatorial measures for transitive functions
- Randomized query composition and product distributions
- Quantum sabotage complexity
- Lifting to randomized parity decision trees
- Searching for falsified clause in random ( n)-CNFs is hard for randomized communication
This page was built for publication: Randomized communication versus partition number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4973872)