90 problems
- 0 votes0 replies0 views
Lovász–Saks log-rank conjecture for deterministic communication complexity
Log-rank conjecture. For any Boolean function , is bounded above by a polynomial in .
- 0 votes0 replies0 views
The log-rank conjecture for Boolean functions
Let and be finite sets, and let be a Boolean function whose communication matrix has rank . Write for its…
- 0 votes0 replies0 views
Standard simplex conjecture, bilinear positive-correlation version
Let and . Consider two measurable partitions and of with…
- 0 votes0 replies0 views
Shift-strategy characterization conjecture for the symmetric group
Shift-strategy characterization conjecture. Every optimal strategy is a shift strategy.
- 0 votes0 replies1 view
The Log Approximation Rank Conjecture
Let be a 2-party function, and let denote its approximation rank at error parameter . Let be the -error randomized communication…
- 0 votes0 replies0 views
The information-order conjecture for interactive sensor-network communication
Information-order conjecture. If the nodes which have more information communicate first, then this brings down the overall communication complexity.
- 0 votes0 replies1 view
Error-resistant protocols for generalized Ulam's game
Let and be sets, let be a function, and let denote the generalized Ulam game in which Pau…
- 0 votes0 replies0 views
Adaptive certified field codes and the complexity of smooth sampler output
Adaptive field codes represent smooth transport fields using only the cells with nonzero perturbation, while certified sampler protocols may also require residual exact-marginal co…
- 0 votes0 replies0 views
Optimality of the sparsity–communication tradeoff for distributed mean estimation
Let be an -sparse mean vector in the horizontal-split distributed mean-estimation model, where each of machines holds a subset of independent sam…
- 0 votes0 replies1 view
Alon et al.'s VC-dimension conjecture for completions of gap Hamming distance
Let be the partial sign matrix for the gap Hamming distance problem, and let be any total sign matrix obtained by replacing every entry of…
- 0 votes0 replies1 view
Pătrașcu's Multiphase conjecture for Boolean Disjointness and Inner Product
Let , and consider the Multiphase Problem in which vectors are preprocessed, an update vector modifies the…
- 0 votes0 replies1 view
The monochromatic-rectangle formulation of the log-rank conjecture
Let be a Boolean matrix, and let a monochromatic rectangle be a submatrix all of whose entries have the same value. Let denote the rank of over the reals,…
- 0 votes0 replies1 view
Lovett–Singer–Sudan conjecture on cross-intersecting set systems
Let and be families in , and suppose that is -cross-intersecting, me…
- 0 votes0 replies1 view
The signed-rectangle-rank formulation of the log-rank conjecture
Let be a Boolean matrix. Let be its partitioning number, and let be the minimum number of primitive matrices needed to express as…
- 0 votes0 replies0 views
The log-rank conjecture for Boolean matrices
Let be a Boolean matrix. Write for its rank over the reals, for its partitioning number, and let the communication complexity of be the…
- 0 votes0 replies0 views
Bounded -norm decomposition conjecture for Boolean matrices
Let be an Boolean matrix, and let denote its -norm. A blocky matrix is a blow-up of a permutation matrix. Bounded -norm decomposit…
- 0 votes0 replies0 views
Hambardzumyan–Hatami–Hatami bounded normalized trace norm conjecture
Let be a Boolean matrix, and call a submatrix monochromatic if it is all zeros or all ones. The normalized trace norm is the trace norm normalized by the matrix dimensions, as…
- 0 votes0 replies0 views
Linear monochromatic submatrix conjecture for bounded randomized communication
Let be an Boolean matrix, and let randomized communication complexity mean the public-coin randomized communication complexity of . A submatrix is monochromatic…
- 0 votes0 replies0 views
Extension of the lower bounds to all unbiased compressors
Unbiased-compressor lower-bound conjecture. The lower bounds proved in the paper should also hold for the entire family of unbiased compressors.
- 0 votes0 replies1 view
The large constant submatrix conjecture for bounded max-norm matrices
Let be an binary matrix, with entries in , and let denote its factorization max-norm. A submatrix is obtained by restricting to selected…
- 0 votes0 replies0 views
The bounded blocky-matrix complexity conjecture for bounded max-norm
Let be a Boolean matrix, meaning a matrix with entries in . Its factorization max-norm is denoted by , and let be the minimum numbe…
- 0 votes0 replies0 views
Tyagi's binary source public-communication conjecture
Tyagi's public-communication conjecture. Any such protocol must reveal publicly at least
- 0 votes0 replies0 views
Lovett's sparse low-rank matrix conjecture
Lovett's conjecture. The matrix contains an all-zero square submatrix of size at least
- 0 votes0 replies0 views
Characterization of constant-communication XOR-lifts
Let a Boolean function be a function taking values in , and let its XOR-lift be the associated communication problem obtained by evaluating the function on the coordinatew…
- 0 votes0 replies0 views
Gowers–Viola conjecture on the hardness of iterated group multiplication
Let be a group, and let ? Wait: the paper considers the number-on-forehead communication problem in which the input is a matrix of elements o…