Tight Bounds on the Randomized Communication Complexity of Vector-in-Subspace
cs.CC, quant-ph
Submitted: 2026-10-21
Updated: 2026-10-21
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Related papers
- Parameterized Hardness of Zonotope Containment and Neural Network Verification
- Optimal Unambiguous DNFs and Alon-Saks-Seymour
- On the Limits of Quantum Multiparty Simultaneous Communication
- Learning, Compression, and Meta-Complexity
- Hardware-Algorithm Co-Optimization of Early-Exit Neural Networks for Multi-Core Edge Accelerators
- Quantum Fine-Grained Lower Bounds for SetDisjointness via Sub-Linear Reductions from 3SUM