Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations
Computational complexity theorySemi-membershipUwe Schöning

Broader (1)

Structural complexity theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Top NewSQL Databases and Features Classification
NewSQL databases motivate us to analyze its big data throughput and we could classify them into good data or bad data. We… 
2018
2018
MULTI-FIDELITY MODELS FOR DECOMPOSED SIMULATION OPTIMIZATION PROBLEMS
Hierarchical problem decomposition methods are widely used in optimization when the scale of the problem is large. The master… 
2016
2016
La configuración de la imagen de san Vicente Ferrer en el siglo XV
Saint Vicente Ferrer was a sublime preacher able to excite masses in an important part of Europe. Likewise, his titanic figure… 
2010
2010
Matching Space Antenna Deformation Electronic Compensation Strategies to Support Structure Architectures
Radar systems are engineered to achieve a complex, yet functional, balance between diverse subsystems and competing requirements… 
1996
1996
UP and the low and high hierarchies: A relativized separation
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… 
1996
1996
Upper bounds for the complexity of sparse and tally descriptions
We investigate the complexity of computing small descriptions for sets in various reduction classes to sparse sets. For example… 
1995
1995
A refinement of the low and high hierarchies
Based on the ε- and Δ-classes of the polynomial-time hierarchy, Schöning [S1], [S3]introduced low and high hierarchies within NP… 
1993
1993
Counting, Selecting, adn Sorting by Query-Bounded Machines
We study the query-complexity of counting, selecting, and sorting functions. That is, for a given set A and a positive integer k… 
1992
1992
The Extended Low Hierarchy is an Infinite Hierarchy
Balcźar, Book, and Schoning introduced the extended low hierarchy based on the σ-levels of the polynomial-time hierarchy as… 
1991
1991
Nonuniform Proof Systems: A New Framework to Describe Nonuniform and Probabilistic Complexity Classes
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)