Optimal Unambiguous DNFs and Alon-Saks-Seymour
This paper constructs unambiguous DNFs with width O(n) and Ω(n^2) 0-certificate complexity, and proves a lifting theorem to communicate the separation in certificate complexity to communication complexity, leading to optimal results for the Alon-Saks-Seymour conjecture and Clique versus Independent Set problem.
Construction of unambiguous DNFs with optimal certificate complexity and communication complexity separation, and the lifting theorem to translate this separation.
Keywords
Before reading this…
Applications
- →Alon-Saks-Seymour conjecture
- →Clique versus Independent Set
To understand this paper, make sure you know these concepts first:
- Basic knowledge of Boolean functions, DNFs, certificate complexity, communication complexityfind papers →
Abstract
More Like ThisWe construct unambiguous DNFs having width $O(n)$ but $0$-certificate complexity $Ω(n^2)$. By utilizing the special structure of these DNFs, we prove a lifting theorem with a constant-sized gadget that lifts the DNF to a communication problem, while losslessly translating the separation in certificate complexity to a separation in communication complexity. This leads to an optimal refutation of the Alon-Saks-Seymour conjecture, as well as an optimal communication lower bound for the Clique versus Independent Set problem, improving the previous results of Balodis, Ben-David, Göös, Jain and Kothari (FOCS 2021, SICOMP 2023) by several doubly logarithmic factors. As further applications of our construction to query complexity and learning theory, we exhibit: (a) a family of Boolean functions that has an optimal quartic separation between certificate complexity and approximate degree, and (b) a sample compression lower bound of $Ω(\sqrt{\log c})$ for multiclass concept classes over $c$ labels.