Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 224,301,647 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
Boolean circuit
Complement (complexity)
NP (complexity)
Polynomial hierarchy
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2004
2004
On the reducibility of sets inside NP to sets with low information content
Mitsunori Ogihara
,
Till Tantau
Journal of computer and system sciences (Print)
2004
Corpus ID: 11030898
2004
2004
Reasoning with power defaults
Guo-Qiang Zhang
,
W. Rounds
Theoretical Computer Science
2004
Corpus ID: 17607240
Review
2004
Review
2004
Exact-Four-Colorability, Exact Domatic Number Problems, and the Boolean Hierarchy
J. Rothe
Algebraic Methods in Computational Complexity
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…
Expand
1999
1999
Boolean Hierarchies inside Dot – Depth One
Heinz Schmitz
1999
Corpus ID: 15172524
Let B denote the class of languages having dot–depth , i.e., the class of languages that can we written as finite unions of…
Expand
1998
1998
On boolean lowness and boolean highness
S. Reith
,
K. Wagner
Theoretical Computer Science
1998
Corpus ID: 12402532
1998
1998
The Boolean Hierarchy over Level 1/2 of the Straubing-Therien Hierarchy
Heinz Schmitz
,
K. Wagner
arXiv.org
1998
Corpus ID: 57157
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…
Expand
1994
1994
A Machine Model for NP-Approximation Problems and the Revenge of the Boolean Hierarchy
Richard Chang
Bull. EATCS
1994
Corpus ID: 13909045
This column addresses the following questions about the complexity of approximating the CLIQUE problem. 1. Is nding the vertices…
Expand
1991
1991
On the Structure of NP Computations under Boolean Operators
Richard Chang
1991
Corpus ID: 118212969
This thesis is mainly concerned with the structural complexity of the Boolean Hierarchy. The Boolean Hierarchy is composed of…
Expand
1990
1990
Random Reductions in the Boolean Hierarchy are Not Robust.
Richard Chang
,
P. Rohatgi
1990
Corpus ID: 123638595
We investigate random reductions from complete sets in the Boolean Hierarchy to their complements. We show that under the…
Expand
1990
1990
Strong Separations for the Boolean Hierarchy over RP
D. Bruschi
,
D. Joseph
,
Paul Young
International Journal of Foundations of Computer…
1990
Corpus ID: 20368505
Recently, boolean hierarchies over NP and over RP (denoted BH and RBH respectively) have been introduced in complexity theory…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE