Low and high hierarchies

Known as: High hierarchy, Low hierarchy 
In the computational complexity theory, the low hierarchy and high hierarchy of complexity levels were introduced in 1983 by Uwe Schöning to describe… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1983-2015
02419832015

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2002
2002
Say that a d.c.e. degree d is isolated by a c.e. degree b, if b < d and any c.e. degree c below d is also below b, namely, b is… (More)
Is this relevant?
1997
1997
It is known that for any class C closed under union and intersection, the Boolean closure of C, the Boolean hierarchy over C, and… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1997
1997
We introduce a generalization of Selman's P-selectivity that yields a more exible notion of selectivity, called (polynomial-time… (More)
  • figure 2
  • figure 3
Is this relevant?
1996
1996
We investigate the complexity of computing small descriptions for sets in various reduction classes to sparse sets. For example… (More)
Is this relevant?
1995
1995
Based on the ε- and Δ-classes of the polynomial-time hierarchy, Schöning [S1], [S3]introduced low and high hierarchies within NP… (More)
Is this relevant?
1993
1993
The low hierarchy within NP and the extended low hierarchy h a ve turned out to be very useful in classifying many i n teresting… (More)
Is this relevant?
1992
1992
The low and high hierarchies within NP were introduced by Schöning in order to classify sets in NP. It is not known whether the… (More)
Is this relevant?
1992
1992
Balc azar, Book, and Sch oning introduced the extended low hierarchy based on the levels of the polynomial-time hierarchy as… (More)
  • figure 3
Is this relevant?
Highly Cited
1983
Highly Cited
1983
A low and a high hierarchy within NP are defined. The definition is similar to the jump hierarchies below the degree of the… (More)
Is this relevant?