scientific article; zbMATH DE number 7650118
From MaRDI portal
Publication:5875509
DOI10.4230/LIPIcs.APPROX-RANDOM.2019.51MaRDI QIDQ5875509
No author found.
Publication date: 3 February 2023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Zero-information protocols and unambiguity in Arthur-Merlin communication
- An information statistics approach to data stream and communication complexity
- Disjointness is hard in the multiparty number-on-the-forehead model
- Bounded-depth circuits cannot sample good codes
- On the distributional complexity of disjointness
- The space complexity of approximating the frequency moments
- The BNS lower bound for multi-party protocols is nearly optimal
- The equivalence of sampling and searching
- Approximate nonnegative rank is equivalent to the smooth rectangle bound
- A strong direct product theorem for corruption and the multiparty communication complexity of disjointness
- Bi-Lipschitz bijection between the Boolean cube and the Hamming ball
- On Information Complexity in the Broadcast Model
- The Multiparty Communication Complexity of Set Disjointness
- A strong direct product theorem for disjointness
- The Complexity of Distributions
- Beyond set disjointness
- Algebrization
- New Bounds for the Garden-Hose Model
- Unifying the Landscape of Cell-Probe Lower Bounds
- Sparse and Lopsided Set Disjointness via Information Theory
- Extractors for Turing-Machine Sources
- The Pattern Matrix Method
- The Simultaneous Communication of Disjointness with Applications to Data Streams
- Interaction in Quantum Communication
- Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND
- The Probabilistic Communication Complexity of Set Intersection
- The Quantum Communication Complexity of Sampling
- Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness
- Quantum communication complexity of symmetric predicates
- Strong Direct Product Theorems for Quantum Communication and Query Complexity
- Quadratic Maps Are Hard to Sample
- Multiparty Communication Complexity and Threshold Circuit Size of AC^0
- The Communication Complexity of Set-Disjointness with Small Sets and 0-1 Intersection
- Time Hierarchies for Sampling Distributions
- Streaming Communication Protocols
- Polynomial pass lower bounds for graph streaming algorithms
- Sampling Lower Bounds: Boolean Average-Case and Permutations
- Cell-probe lower bounds from online communication complexity
- Hardness of approximate nearest neighbor search
- Efficient Protocols for Generating Bipartite Classical Distributions and Quantum States
- Correlation in Hard Distributions in Communication Complexity
- Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness
- On the Implementation of Huge Random Objects
- Quantum and Classical Strong Direct Product Theorems and Optimal Time‐Space Tradeoffs
- Extractors for Circuit Sources
- From information to exact communication
- An information complexity approach to extended formulations
- Communication Lower Bounds Using Directional Derivatives
- Inner Product and Set Disjointness
- Rectangles Are Nonnegative Juntas
- Extractors and Lower Bounds for Locally Samplable Sources
- Information complexity of the AND function in the two-party and multi-party settings
