Several Separations Based on a Partial Boolean Function

03/09/2021 ∙ by Kaspars Balodis, et al. ∙ 0

We show a partial Boolean function f together with an input x∈ f^-1(*) such that both C_0̅(f,x) and C_1̅(f,x) are at least C(f)^2-o(1). Due to recent results by Ben-David, Göös, Jain, and Kothari, this result implies several other separations in query and communication complexity. For example, it gives a function f with C(f)=Ω(deg^2-o(1)(f)) where C and deg denote certificate complexity and polynomial degree of f. (This is the first improvement over a separation between C(f) and deg(f) by Kushilevitz and Nisan in 1995.) Other implications of this result are an improved separation between sensitivity and polynomial degree, a near-optimal lower bound on conondeterministic communication complexity for Clique vs. Independent Set problem and a near-optimal lower bound on complexity of Alon–Saks–Seymour problem in graph theory.



There are no comments yet.


page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

1 The puzzle

Recently Ben-David, Göös, Jain, and Kothari published a paper [ben2021unambiguous] demonstrating that several separation problems can be reformulated (disguised) as one of three equivalent puzzles, hinting that such formulations may be more seductive for tricking more people into trying to solve them. We report that they have indeed succeeded and show an optimal solution to one of the puzzles.

We use the following formulation from [ben2021unambiguous]. Consider a partial Boolean function where some of the inputs are undefined, . Let be a subset of output symbols. Denote by , , , the output sets , , , . A partial input is a -certificate for if is consistent with (i.e., for each entry in , the corresponding entry of contains the same symbol or ) and for every input consistent with we have . The size of , denoted , is the number of its non- entries. The -certificate complexity of , denoted , is the least size of a -certificate for . The -certificate complexity of , denoted is the maximum of over all . Finally, we define the certificate complexity as .

Puzzle. For , does there exist a partial function together with an such that both and are at least ?

Abusing the terminology, instead of a single Boolean function actually an infinite sequence of functions satisfying as is meant. It is known that a solution with would be optimal. In [ben2021unambiguous] a simple function with inspired by the board game Hex is constructed. It is also conjectured that the puzzles are soluble with exponent . Indeed, this is the case and we demonstrate a function achieving the optimal .

2 The solution

Our contribution is as follows.

Theorem 1.

There exists a monotone partial Boolean function and an input such that both and are at least .

We denote by the set .

Let be a collection of independent random functions where the output is chosen uniformly from .

Lemma 1.

Let . Consider an arbitrary with

. With probability



First, let us consider a random

. Define a random variable



Therefore, is an upper bound on .

By the Chernoff inequality (see e.g. [chung2006concentration]) .


Now, let us calculate the probability that there exists such that violates the inequality in the Lemma statement.

Consider an input consisting of variables with and . The input is interpreted as an matrix containing pairs of Boolean values as entries. The variable pair is the entry in the -th row and -th column. We refer to the -th row by .

We call two entries and matching if . We call two distinct rows and matching if in each column they have matching entries.

We call a row bad if it contains an entry .

For every pair , we call the rows associated with the rows .

Define if there exist two matching rows , and none of the associated rows are bad.

Notice that a bad row dismisses its chance to be matching with any other row, as well as spoils every pair for which it is associated.

Define if there exists a certificate on at most variables which certifies that .

Otherwise, define .

More formally,

because the two matching rows together with the associated rows certify that .

by definition.

Consider the input in which , and for . I.e., the diagonal entries are , and all other entries are . Clearly, as every pair of rows are non-matching, due to the diagonal entries.

because there are no bad rows and every pair of rows could be made matching by setting , therefore any certificate certifying that should contain at least one of and for every .

Claim 1.



Let be a partial input consistent with that has size . We will construct a -certificate consistent with with size . By averaging, there exists a column in which has read (one or both variables) from entries. In this column in the unseen entries we write in , therefore making the corresponding rows bad, hence unfit for being matching. Here we have used no more than variables in .

Now we have to spoil the remaining possible pairs. Notice that, by association, most of these pairs are already spoiled. By Lemma 1 there are at most possibly matching unspoiled pairs of rows (the rest are spoiled by having at least one bad row associated with them). We spoil each of them by exposing in two zeros that make these rows non-matching. With this, the -certificate is complete – every pair of rows are shown to be non-matching or having an associated bad row. In this step we have used at most variables in , and at most in total.

Therefore, we have constructed a -certificate that is consistent with and has size . Therefore, cannot be a -certificate, i.e., any -certificate must have size . ∎

By setting , we have

and Theorem 1 follows.

Notice that is monotone, i.e., flipping any bit in an input from to can only change from to or , or from to 1. This is no coincidence, because, in fact, was derived from a somewhat more complex function by a transformation inspired by [ben2021unambiguous, Remark 15] which transforms a function into a monotone one.

3 The implications

In this section we list the main bounds and separations arising from our result. All of them are noted in [ben2021unambiguous]. As they cover a wide range of concepts and contain no new contributions from our side, we restrict ourselves to only listing them and indeed even do not define all the terminology used for stating them, but refer the reader to [ben2021unambiguous] and other mentioned sources instead.

The following two corollaries follow from the other two formulations of equivalent puzzles in [ben2021unambiguous].

Corollary 1.

There exists a Boolean function f with .

Corollary 2.

There exists an intersecting hypergraph together with a colouring such that every -monochromatic hitting set has size at least .

The next corollary follows from [goos2015lower] and gives a near-optimal lower bound for the complexity of the Clique vs. Independent Set problem by Yannakakis [yannakakis1991expressing].

Corollary 3.

There exists a graph such that the requires bits of conondeterministic communication.

Equivalently (see, e.g., [bousquet2014clique]), the same gap applies to the graph-theoretic Alon–Saks–Seymour problem.

Corollary 4.

There exists a graph G such that .

The next two separations follow from the cheat sheet constructions [ben2016low, aaronson2016separations]. They improve the power- separation due to [ben2021unambiguous] and the power- separation due to Nisan, Kushilevitz, and Widgerson [nisan1995rank], respectively.

Corollary 5.

There exists a Boolean function with .

Corollary 6.

There exists a Boolean function with .