Informational complexity and the direct sum problem for simultaneous message complexity

DOI10.1109/SFCS.2001.959901MaRDI QIDQ7240058zbMATH OpenFDO

Authors Amit Chakrabarti, Yaoyun Shi, Anthony Wirth, Andrew Chi-Chih Yao

Publication date 8 May 2026

Full work available at URL https://doi.org/10.1109/SFCS.2001.959901

Mathematics Subject Classification ID

Computer science (68-XX)

Cited in

(1)

• New algorithms and lower bounds for streaming tournaments

This page was built for publication: Informational complexity and the direct sum problem for simultaneous message complexity

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