Boolean hierarchy

The boolean hierarchy is the hierarchy of boolean combinations (intersection, union and complementation) of NP sets. Equivalently, the boolean hierarchy can be described as the class of boolean circuits over NP predicates. A collapse of the boolean hierarchy would imply a collapse of the polynomial hierarchy.^[1]

Formal definition

BH is defined as follows:^[2]

• BH₁ is NP.
• BH_2k is the class of languages which are the intersection of a language in BH_2k-1 and a language in coNP.
• BH_2k+1 is the class of languages which are the union of a language in BH_2k and a language in NP.
• BH is the union of the BH_i

Derived classes

• DP (Difference Polynomial Time) is BH₂.^[3]

Equivalent definitions

Defining the conjunction and the disjunction of classes as follows allows for more compact definitions. The conjunction of two classes contains the languages that are the intersection of a language of the first class and a language of the second class. Disjunction is defined in a similar way with the union in place of the intersection.

• C ∧ D = { A ∩ B | A ∈ C   B ∈ D }
• C ∨ D = { A ∪ B | A ∈ C   B ∈ D }

According to this definition, DP=NP ∧ coNP. The other classes of the Boolean hierarchy can be defined as follows.

$BH_{2k} = coNP \wedge BH_{2k-1}$

$BH_{2k+1} = NP \vee BH_{2k}$

The following equalities can be used as alternative definitions of the classes of the Boolean hierarchy:^[4]

$BH_{2k} = \bigvee_{i=1}^k DP$

$BH_{2k+1} = NP \vee \bigvee_{i=1}^k DP$

Alternatively,^[5] for every k ≥ 3:

$BH_k = DP \vee BH_{k-2}$

Hardness

Hardness for classes of the Boolean hierarchy can be proved by showing a reduction from a number of instances of an arbitrary NP-complete problem A. In particular, given a sequence {x₁, ... x_m} of instances of A such that x_i ∈ A implies x_i-1 ∈ A, a reduction is required that produces an instance y such that y ∈ B if and only if the number of x_i ∈ A is odd or even:^[4]

• BH_2k-hardness is proved if m=2k and the number of x_i ∈ A is odd
• BH_2k+1-hardness is proved if m=2k+1 and the number of x_i ∈ A is even

Such reductions work for every fixed k. If such reductions exist for arbitrary k, the problem is hard for P^{NP[O(log n)]}.

References

1. Chang, R.; Kadin, J. (1996). "The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection". SIAM J. Comput. 25 (25): 340–354. doi:10.1137/S0097539790178069.
2. Complexity Zoo: Class BH
3. Complexity Zoo: Class DP
4. Wagner, K. (1987). "More Complicated Questions About Maxima and Minima, and Some Closures of NP". Theoret. Comput. Sci. 51: 53–80. doi:10.1016/0304-3975(87)90049-1.
5. Riege, T.; Rothe, J. (2006). "Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems - a Survey". J. Univers. Comput. Sci. 12 (5): 551–578.