Log-rank and lifting for AND-functions
From MaRDI portal
Publication:6086994
DOI10.1145/3406325.3450999arXiv2010.08994OpenAlexW3108023983MaRDI QIDQ6086994
Alexander Knop, Unnamed Author, Unnamed Author, Shachar Lovett
Publication date: 14 November 2023
Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.08994
Related Items (3)
On (simple) decision tree rank ⋮ Bipartite perfect matching as a real polynomial ⋮ Dimension-free bounds and structural results in communication complexity
This page was built for publication: Log-rank and lifting for AND-functions