Communication complexity with defective randomness

DOI10.4230/LIPICS.CCC.2021.14OpenAlexW3185201063MaRDI QIDQ6115368

Oded Goldreich, Tal Malkin, Marshall Ball

Publication date: 12 July 2023

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

zbMATH Keywords

min-entropyrandomness extractionrandomized communication complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

Almost Chor-Goldreich sources and adversarial random walks

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