Skip to search formSkip to main contentSkip to account menu

Boolean hierarchy

Known as: DP, DP (complexity) 
The boolean hierarchy is the hierarchy of boolean combinations (intersection, union and complementation) of NP sets. Equivalently, the boolean… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2004
2004
2000
2000
We study whether one can prune solutions from NP functions. Though it is known that, unless surprising complexity class collapses… 
Highly Cited
1995
Highly Cited
1995
  • S. Buss
  • Annals of Pure and Applied Logic
  • 1995
  • Corpus ID: 7705770
1992
1992
This paper proves that “promise classes” are so fragilely structured that they do not robustly (i.e. with respect to all oracles… 
Highly Cited
1990
Highly Cited
1990
It is shown that if the Boolean hierarchy collapses to level k, then the polynomial hierarchy collapses to BH/sub 3/(k), where BH… 
Highly Cited
1989
Highly Cited
1989
The Boolean Hierarchy I: Structural Properties [J. Cai et al., SIAM J. Comput ., 17 (1988), pp. 1232–252] explores the structure… 
Highly Cited
1988
Highly Cited
1988
In this paper, we study the complexity of sets formed by boolean operations (union, intersection, and complement) on NP sets… 
Highly Cited
1988
Highly Cited
1988
  • Jim Kadin
  • [] Proceedings. Structure in Complexity Theory…
  • 1988
  • Corpus ID: 8171863
It is shown that if the Boolean hierarchy (BH) collapses, then there exists a sparse set S such that co-NP contained in NP/sup S… 
Highly Cited
1986
Highly Cited
1986
In this paper, we study the complexity of sets formed by boolean operations (∪, ∩, and complementation) on NP sets. These are the…