The Boolean Hierarchy I: Structural Properties

  title={The Boolean Hierarchy I: Structural Properties},
  author={Jin-Yi Cai and Thomas Gundermann and Juris Hartmanis and Lane A. Hemaspaandra and Vivian Sewelson and Klaus W. Wagner and Gerd Wechsung},
  journal={SIAM J. Comput.},
In this paper, we study the complexity of sets formed by boolean operations (union, intersection, and complement) on NP sets. These are the sets accepted by trees of hardware with NP predicates as leaves, and together these form the boolean hierarchy.We present many results about the structure of the boolean hierarchy: separation and immunity results, natural complete languages, and structural asymmetries between complementary classes.We show that in some relativized worlds the boolean… Expand

Figures and Topics from this paper

On the structure of NP computations under Boolean operators
This thesis is mainly concerned with the structural complexity of the Boolean Hierarchy. The Boolean Hierarchy is composed of complexity classes constructed using Boolean operators on NPExpand
Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets
It is shown that two hierarchies---the Hausdorff hierarchy and the nested difference hierarchy---which in the NP case are equal to the Boolean closure fail to be equal for the UP case in some relativized worlds, and it is proved that closure under union is not needed for this claim. Expand
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages
The purpose of this paper is to provide efficient algorithms that decide membership for classes of several Boolean hierarchies for which efficiency (or even decidability) were previously notExpand
The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection
We show that if the Boolean hierarchy collapses to level $k$, then the polynomial hierarchy collapses to $BH_{3}(k)$, where $BH_{3}(k)$ is the $k$th level of the Boolean hierarchy overExpand
On computing Boolean connectives of characteristic functions
The results in this paper characterize the complete sets for the classes Dp and pSAT[O(logn)] in terms of AND and OR and relate these functions to the structure of the Boolean hierarchy and the query hierarchies. Expand
Efficient algorithms for membership in boolean hierarchies of regular languages
Efficient algorithms that decide membership for classes of several Boolean hierarchies for which efficiency (or even decidability) were previously not known are provided. Expand
On High and Low Sets for the Boolean Hierarchy
The polynomial-time hierarchy (PH) is central for many considerations of complexity theory. We call a set A 2 NP high (low, resp.) for the class p k of the polynomial-time hierarchy if p kExpand
On NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems
This work gives an exhaustive answer to the question which relativizable inclusions between partition classes can occur depending on the relation between their defining posets, and gets a complete characterization when such solution reductions are possible. Expand
Boolean Hierarchies inside Dot – Depth One
Let B denote the class of languages having dot–depth , i.e., the class of languages that can we written as finite unions of languages u A u A un A un, where ui A and n . A language has dot–depth oneExpand
Query Order and Self-Specifying Machines
We study the computational power of machines that specify their own acceptance types, and we show that they accept exactly the languages in R_m^{#P}(NP). We study the effect of query order onExpand