scientific article; zbMATH DE number 7758330
From MaRDI portal
Publication:6062152
DOI10.4230/lipics.approx/random.2020.28arXiv2006.10957MaRDI QIDQ6062152
Unnamed Author, Mika Göös, Robin Kothari, Shalev Ben-David
Publication date: 31 October 2023
Full work available at URL: https://arxiv.org/abs/2006.10957
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal direct sum results for deterministic and randomized decision tree complexity
- Complexity measures and decision tree complexity: a survey.
- The Information Complexity Of Hamming Distance
- Computing in fault tolerant broadcast networks and noisy decision trees
- Query Complexity in Expectation
- Average-Case Lower Bounds for Noisy Boolean Decision Trees
- On boolean decision trees with faulty nodes
- Computing with Noisy Information
- Deterministic Communication vs. Partition Number
- Separations in Query Complexity Based on Pointer Functions
- Randomized Communication versus Partition Number
- A Composition Theorem for Randomized Query Complexity
- En Route to the Log-Rank Conjecture: New Reductions and Equivalent Formulations
- Separations in query complexity using cheat sheets
- Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching
- Rectangles Are Nonnegative Juntas
This page was built for publication:
