Communication complexity with defective randomness

DOI10.4230/LIPICS.CCC.2021.14MaRDI QIDQ6115368zbMATH OpenOpenAlexFDO

Authors Marshall Ball, Oded Goldreich, Tal Malkin

Publication date 12 July 2023

Full work available at URL https://doi.org/10.4230/LIPIcs.CCC.2021.14

zbMATH Keywords

min-entropyrandomized communication complexityrandomness extraction

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited in

(5)

• Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
• scientific article; zbMATH DE number 1769898 (Why is no real title available?)
• Almost Chor-Goldreich sources and adversarial random walks
• The cost of the missing bit: Communication complexity with help
• Communication complexity of equality and error-correcting codes

This page was built for publication: Communication complexity with defective randomness

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