You are currently offline. Some features of the site may not work correctly.

# 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… Expand
Wikipedia

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
• Inf. Comput.
• 2008
• Corpus ID: 11545674
We introduce the boolean hierarchy of k-partitions over NP for k>=3 as a generalization of the boolean hierarchy of sets (i.e., 2… Expand
Is this relevant?
2004
2004
• J. Comput. Syst. Sci.
• 2004
• Corpus ID: 11030898
We study whether sets inside NP can be reduced to sets with low information content but possibly still high computational… Expand
Is this relevant?
1999
1999
• ArXiv
• 1999
• Corpus ID: 13875152
Downward translation of equality refers to cases where a collapse of some pair of complexity classes would induce a collapse of… Expand
Is this relevant?
Highly Cited
1996
Highly Cited
1996
• SIAM J. Comput.
• 1996
• Corpus ID: 8327162
We show that if the Boolean hierarchy collapses to level $k$, then the polynomial hierarchy collapses to $BH_{3}(k)$, where $BH_… Expand Is this relevant? Highly Cited 1991 Highly Cited 1991 • R. Beigel • Theor. Comput. Sci. • 1991 • Corpus ID: 205093899 We study the complexity of decision problems that can be solved by a polynomial-time Turing machine that makes a bounded number… Expand Is this relevant? 1991 1991 • Inf. Process. Lett. • 1991 • Corpus ID: 35379622 Abstract We show that probabilistic polynomial time (PP) is closed under polynomial-time parity reductions. As corollaries, we… Expand Is this relevant? 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… Expand Is this relevant? Highly Cited 1988 Highly Cited 1988 • J. Kadin • SIAM J. Comput. • 1988 • Corpus ID: 42548458 It is shown that if the Boolean hierarchy (BH) collapses, then there exists a sparse set S such that${\text{co-NP}} \subseteq… Expand
Is this relevant?
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… Expand
Is this relevant?
Highly Cited
1986
Highly Cited
1986
• Computational Complexity Conference
• 1986
• Corpus ID: 33585476
In this paper, we study the complexity of sets formed by boolean operations (∪, ∩, and complementation) on NP sets. These are the… Expand
Is this relevant?