An XOR lemma for deterministic communication complexity

DOI10.1109/FOCS61266.2024.00034MaRDI QIDQ7286903zbMATH OpenFDO

Authors Siddharth Iyer, Anup Rao

Publication date 23 June 2026

Full work available at URL https://doi.org/10.1109/FOCS61266.2024.00034

Mathematics Subject Classification ID

Computer science (68-XX)

This page was built for publication: An XOR lemma for deterministic communication complexity

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