Unambiguous DNFs and Alon-Saks-Seymour

02/16/2021
by   Kaspars Balodis, et al.
0

We exhibit an unambiguous k-DNF formula that requires CNF width Ω̃(k^2), which is optimal up to logarithmic factors. As a consequence, we get a near-optimal solution to the Alon–Saks–Seymour problem in graph theory (posed in 1991), which asks: How large a gap can there be between the chromatic number of a graph and its biclique partition number? Our result is also known to imply several other improved separations in query and communication complexity.

READ FULL TEXT
03/09/2021

Several Separations Based on a Partial Boolean Function

We show a partial Boolean function f together with an input x∈ f^-1(*) s...
09/28/2020

Distributed Maximization of Submodular and Approximately Submodular Functions

We study the problem of maximizing a submodular function, subject to a c...
11/02/2020

Complexity of near-optimal robust versions of multilevel optimization problems

Near-optimality robustness extends multilevel optimization with a limite...
05/12/2021

Optimal pointwise sampling for L^2 approximation

Given a function u∈ L^2=L^2(D,μ), where D⊂ℝ^d and μ is a measure on D, a...
05/09/2019

Revisiting Graph Width Measures for CNF-Encodings

We consider bounded width CNF-formulas where the width is measured by po...
10/07/2021

On the Optimal Memorization Power of ReLU Neural Networks

We study the memorization power of feedforward ReLU neural networks. We ...
03/02/2021

Algorithmic Obstructions in the Random Number Partitioning Problem

We consider the algorithmic problem of finding a near-optimal solution f...