Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,700,866 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.
2014
2014
Toward the Complexity of the Existence of Wonderfully Stable Partitions and Strictly Core Stable Coalition Structures in Hedonic Games
Anja Rey
,
J. Rothe
,
Hilmar Schadrack
,
Lena Schend
International Symposium on Artificial…
2014
Corpus ID: 6141774
We study the computational complexity of the existence and the verification problem for wonderfully stable partitions (WSPE and…
Expand
2007
2007
Characterizations of some complexity classes between Θ p 2 and ∆ p 2
J. Castro
2007
Corpus ID: 11574013
We give some characterizations of the classes P [O(log n)]. First, we show that these classes are equal to classes ACk−1(NP…
Expand
2007
2007
On High and Low Sets for the Boolean Hierarchy
S. Reith
,
K. Wagner
,
Highpk Highpk
,
Lowpk Lowpk
2007
Corpus ID: 117069664
The polynomial-time hierarchy (PH) is central for many considerations of complexity theory. We call a set A 2 NP high (low, resp…
Expand
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
1997
1997
An Introduction to Query Order
E. Hemaspaandra
,
Lane A. Hemaspaandra
,
Harald Hempel
Bull. EATCS
1997
Corpus ID: 17390922
Hemaspaandra, Hempel, and Wechsung raised the following questions: If one is allowed one question to each of two different…
Expand
1996
1996
\structure and Complexity"
Eric Allender
,
K. Wagner
,
+6 authors
G. Wechsung
1996
Corpus ID: 17445622
S On the Power of Randomized Branching Programs Farid Ablayev Kazan University (joint work with Marek Karpinski, Universitat…
Expand
1995
1995
Query Order and Self-Specifying Machines
Lane A. Hemaspaandra
,
Harald Hempel
,
G. Wechsung
1995
Corpus ID: 18044660
We study the computational power of machines that specify their own acceptance types, and we show that they accept exactly the…
Expand
1994
1994
Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets1
Lane A. Hemaspaandra
1994
Corpus ID: 265098210
This paper studies, for UP, two topics that have been intensely studied for NP: Boolean hierarchies and the consequences of the…
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