2 papers
cs.CC2026
Multiparty Communication Complexity of Collision Finding
Paul Beame, Michael Whitmeyer
We prove an lower bound on the -party number-in-hand communication complexity of collision-finding. This implies a lower bound on…
cs.CC2025
Quantum Time-Space Tradeoffs for Matrix Problems
Paul Beame, Niels Kornerup, Michael Whitmeyer
We consider the time and space required for quantum computers to solve a wide variety of problems involving matrices, many of which have only been analyzed classically in prior wor…