Communication complexity and discrepancy of halfplanes
From MaRDI portal
Cites work
- A discrepancy lower bound for information complexity
- A trace bound for the hereditary discrepancy
- Communication Complexity
- Complexity measures of sign matrices
- Crossing patterns of semi-algebraic sets
- Discrepancy of set-systems and matrices
- Geometric discrepancy. An illustrated guide
- Halfspace matrices
- scientific article; zbMATH DE number 1263236 (Why is no real title available?)
- scientific article; zbMATH DE number 524134 (Why is no real title available?)
- scientific article; zbMATH DE number 1528185 (Why is no real title available?)
- Learning complexity vs communication complexity
- Lower bound methods for sign-rank and their limitations
- Lower bounds for the approximate degree of block-composed functions
- Lower bounds in communication complexity based on factorization norms
- Optimal bounds for sign-representing the intersection of two halfspaces by polynomials
- Probabilistic communication complexity
- Sign-rank vs. discrepancy
- The pattern matrix method
- Tight upper bounds for the discrepancy of half-spaces
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
This page was built for publication: Communication complexity and discrepancy of halfplanes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6895904)