Matrix hypercontractivity, streaming algorithms and LDCs: the large alphabet case

DOI10.1145/3688824MaRDI QIDQ7022377zbMATH OpenFDO

Authors Srinivasan Arunachalam, João F. Doriguello

Publication date 25 February 2025

Published in ACM Transactions on Computation Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

hypercontractivitymax-cutstreaming algorithmsunique gameslocally decodable codesquantum communication complexity

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Quantum algorithms and complexity in the theory of computing (68Q12) Geometry and structure of normed linear spaces (46B20) Decoding (94B35) Other types of codes (94B60) Communication complexity, information complexity (68Q11)

This page was built for publication: Matrix hypercontractivity, streaming algorithms and LDCs: the large alphabet case

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