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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2001
2001
The boolean hierarchy of partitions was introduced and studied by K. Wagner and S. Kosub, mostly over the lattice of NP -sets. We… (More)
Is this relevant?
1997
1997
  • Richard Chang
  • Electronic Colloquium on Computational Complexity
  • 1997
This paper investigates nondeterministic bounded query classes in relation to the complexity of NP-hard approximation problems… (More)
Is this relevant?
1996
1996
We show that if the Boolean hierarchy collapses to level k, then the polynomial hierarchy collapses to BH3(k), where BH3(k) is… (More)
Is this relevant?
1996
1996
A modular query consists of asking how many (modulo m) of k strings belong to a fixed NP language. Modular queries provide a form… (More)
Is this relevant?
1995
1995
This paper is a study of the existence of polynomial time Boolean connective functions for languages. A languageL has an AND… (More)
  • figure 1
  • table 1
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Beige], R., Bounded queries to SAT and the Boolean hierarchy, Theoretical Computer Science 84(1991)199-223. We study the… (More)
Is this relevant?
1990
1990
In this paper, we show that if the Boolean Hierarchy collapses to level k , then the Polynomial Hierarchy collapses to BH3(k… (More)
  • figure 1
Is this relevant?
Highly Cited
1988
Highly Cited
1988
It is shown that if the Boolean hierarchy (BH) collapses, then there exists a sparse set S such that co-NP C_ NPs, and therefore… (More)
Is this relevant?
Highly Cited
1988
Highly Cited
1988
 
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1987
1987
As a natural extension of P and NP, the Boolean closure of N P has attracted much attention recently. Many interesting properties… (More)
Is this relevant?