Communication complexity of collision

DOI10.4230/LIPICS.APPROX/RANDOM.2022.19MaRDI QIDQ6591869zbMATH OpenFDO

Authors Mika Göös, Siddhartha Jain

Publication date 22 August 2024

Full work available at URL https://doi.org/10.4230/LIPICS.APPROX/RANDOM.2022.19

zbMATH Keywords

collisioncommunication complexitylifting

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Cited in

(2)

• Lower bounds for regular resolution over parities
• Multiparty communication complexity of collision-finding and cutting planes proofs of concise pigeonhole principles

This page was built for publication: Communication complexity of collision

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6591869)