scientific article; zbMATH DE number 7204504
From MaRDI portal
Publication:5111383
DOI10.4230/LIPICS.ICALP.2017.52zbMATH Open1441.68050MaRDI QIDQ5111383FDOQ5111383
Authors:
Publication date: 27 May 2020
Title of this publication is not available (Why is that?)
Recommendations
- Randomized communication versus partition number
- Deterministic communication vs. partition number
- Partition arguments in multiparty communication complexity
- Partition Arguments in Multiparty Communication Complexity
- On multi-partition communication complexity
- LATIN 2004: Theoretical Informatics
- scientific article; zbMATH DE number 2083798
- Private vs. common random bits in communication complexity
- Separating deterministic from randomized multiparty communication complexity
- A communication-randomness tradeoff for two-processor systems
Cited In (11)
- Communication complexity of pairs of graph families with applications
- Some improved bounds on communication complexity via new decomposition of cliques
- Rectangles are nonnegative juntas
- A \(\mathrm{ZPP}^{\mathrm{NP}[1]}\) lifting theorem
- Deterministic communication vs. partition number
- Randomized communication versus partition number
- Time-Space Complexity Advantages for Quantum Computing
- Streaming and communication complexity of clique approximation
- Lifting Theorems for Equality
- Communication complexity of statistical distance
- Query-to-communication lifting for BPP using inner product
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111383)
