Name
Abstract | ||
|---|---|---|
Our colleague and friend Uwe Schoning, who has helped to shape the area of Complexity Theory in many decisive ways is turning 60 this year. As a little birthday present we survey in this column some of the newer results related with the concept of lowness, an idea that Uwe translated from the area of Recursion Theory in the early eighties. Originally this concept was applied to the complexity classes in the polynomial time hierarchy. An overview of the many results inspired by the lowness idea was written by the first author in [25]. We review here the lowness scene 20 years later, focusing mainly in the classes out of PH. |
Year | Venue | Field |
|---|---|---|
2015 | BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE | Theoretical computer science,Calculus,Mathematics |
DocType | Volume | Issue |
Journal | 117 | 117 |
ISSN | Citations | PageRank |
0252-9742 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Johannes Köbler | 1 | 580 | 46.51 |
| Jacobo Torán | 2 | 564 | 49.26 |