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
Review
2004
Review
2004
  • J. Rothe
  • 2004
  • Corpus ID: 46732706
This talk surveys some of the work that was inspired by Wagner's general technique to prove completeness in the levels of the… 
1999
1999
Let B denote the class of languages having dot–depth , i.e., the class of languages that can we written as finite unions of… 
1998
1998
For some fixed alphabet A, a language L of A* is in the class L(1/2) of the Straubing-Therien hierarchy if and only if it can be… 
1994
1994
This column addresses the following questions about the complexity of approximating the CLIQUE problem. 1. Is nding the vertices… 
1991
1991
This thesis is mainly concerned with the structural complexity of the Boolean Hierarchy. The Boolean Hierarchy is composed of… 
1990
1990
We investigate random reductions from complete sets in the Boolean Hierarchy to their complements. We show that under the… 
1990
1990
Recently, boolean hierarchies over NP and over RP (denoted BH and RBH respectively) have been introduced in complexity theory…