Communication Complexity of Integer Matrix Singularity

arXiv:2610.33521 · cs.CC, quant-ph · Submitted 2026-10-24 · Read on arXiv

cs.CC, quant-ph

Submitted: 2026-10-24

Updated: 2026-10-24

Terminology

• Communication Complexity — 1× in this paper · explained in 3 episodes

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