“Boolean hierarchy”的意思、由来-开放百科全书

词条

Boolean hierarchy

释义

Formal definition
Derived classes
Equivalent definitions
Hardness
References

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.

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

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

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 {{tmath|1=m=2k}} and the number of x_i ∈ A is odd
BH_2k+1-hardness is proved if {{tmath|1=m=2k+1}} and the number of x_i ∈ A is even

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

References

1. ^{{cite journal| title = The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection| author = Chang, R.| author2 = Kadin, J.| doi = 10.1137/S0097539790178069| journal = SIAM J. Comput.| year = 1996| volume = 25| pages = 340–354| issue = 25| citeseerx = 10.1.1.77.4186}}
2. ^{{ComplexityZoo|Class BH|B#bh}}
3. ^{{ComplexityZoo|Class DP|D#dp}}
4. ^¹{{cite journal| title = More Complicated Questions About Maxima and Minima, and Some Closures of NP| author = Wagner, K.| doi = 10.1016/0304-3975(87)90049-1| journal = Theoret. Comput. Sci.| year = 1987| volume = 51| pages = 53–80}}
5. ^{{cite journal| title = Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems - a Survey| author = Riege, T.| author2 = Rothe, J.| journal = J. Univers. Comput. Sci.| year = 2006| volume = 12| pages = 551–578| issue = 5}}

1 : Hierarchy

随便看

开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。