scientific article; zbMATH DE number 7563821

DOI10.4086/toc.2022.v018a019OpenAlexW4285230523MaRDI QIDQ5093405

Hamed Hatami, Kaave Hosseini, Shachar Lovett

Publication date: 26 July 2022

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/toc.2022.v018a019

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

discrepancycommunication complexitysign-rank

Mathematics Subject Classification ID

Theory of computing (68Qxx) Communication complexity, information complexity (68Q11)

Cites Work

• Unnamed Item
• Halfspace matrices
• The hardest halfspace
• The Sign-Rank of AC$^0$
• The Pattern Matrix Method
• Optimal bounds for sign-representing the intersection of two halfspaces by polynomials

This page was built for publication: