scientific article; zbMATH DE number 7204504
From MaRDI portal
Publication:5111383
DOI10.4230/LIPICS.ICALP.2017.52zbMATH Open1441.68050MaRDI QIDQ5111383FDOQ5111383
Author name not available (Why is that?)
Publication date: 27 May 2020
Title of this publication is not available (Why is that?)
Cited In (7)
- Title not available (Why is that?)
- Rectangles are nonnegative juntas
- Communication Complexity of Statistical Distance
- Query-To-Communication Lifting for BPP Using Inner Product
- Communication Complexity of Pairs of Graph Families with Applications
- Time-Space Complexity Advantages for Quantum Computing
- Lifting Theorems for Equality
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 👍 👎
- Title not available (Why is that?) 👍 👎
- Private vs. common random bits in communication complexity 👍 👎
- Title not available (Why is that?) 👍 👎
- A communication-randomness tradeoff for two-processor systems 👍 👎
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)
