On the Communication Complexity of AND Functions

DOI10.1109/TIT.2021.3052836MaRDI QIDQ5001839zbMATH OpenOpenAlexFDO

Authors Hsin-Lung Wu

Publication date 23 July 2021

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2021.3052836

zbMATH Keywords

AND functionsLog-rank conjecture

Mathematics Subject Classification ID

Communication complexity, information complexity (68Q11) Boolean functions (94D10)

Cited in

(2)

• Functional inversion and communication complexity
• scientific article; zbMATH DE number 88975 (Why is no real title available?)

This page was built for publication: On the Communication Complexity of AND Functions

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