Direct sum theorems from fortification

DOI10.1007/978-981-96-1090-7_33MaRDI QIDQ6970711zbMATH OpenFDO

Authors Hao Wu

Publication date 17 June 2025

Full work available at URL https://doi.org/10.1007/978-981-96-1090-7_33

zbMATH Keywords

communication complexitydirect sumfortificationprotocol size

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

• Amortized Communication Complexity
• Communication Complexity
• Communication Complexity
• Fractional Covers and Communication Complexity
• Parallel repetition from fortification
• Super-logarithmic depth lower bounds via the direct sum in communication complexity
• Toward the KRW composition conjecture: cubic formula lower bounds via communication complexity

This page was built for publication: Direct sum theorems from fortification

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