Get started
Author

Uwe Schöning

Observed names: Schöning, Uwe, Schöning, Uwe 1955-, U. Schoning, U. Schöning, Uwe Schoning
Institution: Universität Ulm
OpenAlex ID: A5055009733
The Graph Isomorphism Problem
1993 · Johannes Köbler, Uwe Schöning, et al. · Birkhäuser Boston eBooks · 304
Graph isomorphism is in the low hierarchy
1988 · Uwe Schöning · Journal of Computer and System Sciences · 226
PDF
A deterministic (2−2/(k+1))n algorithm for k-SAT based on local search
2002 · Evgeny Dantsin, Andreas Goerdt, et al. · Theoretical Computer Science · 225
PDF
A low and a high hierarchy within NP
1983 · Uwe Schöning · Journal of Computer and System Sciences · 156
PDF
The difference and truth-table hierarchies for NP
1987 · Johannes Köbler, Uwe Schöning, et al. · RAIRO - Theoretical Informatics and Applications · 118
PDF
Bi-immune sets for complexity classes
1985 · José L. Balcázar, Uwe Schöning · Theory of Computing Systems · 117
Probabilistic complexity classes and lowness
1989 · Uwe Schöning · Journal of Computer and System Sciences · 114
PDF
A Probabilistic 3—SAT Algorithm Further Improved
2002 · Thomas Hofmeister, Uwe Schöning, et al. · Lecture notes in computer science · 100
Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break
2012 · Adrian Balint, Uwe Schöning · Lecture notes in computer science · 95
A uniform approach to obtain diagonal sets in complexity classes
1982 · Uwe Schöning · Theoretical Computer Science · 87
PDF
On Circuit-Size Complexity and the Low Hierarchy in NP
1985 · Ker-I Ko, Uwe Schöning · SIAM Journal on Computing · 86
The polynomial-time hierarchy and sparse oracles
1986 · Jose L. Balcázar, Ronald V. Book, et al. · Journal of the ACM · 85
PDF
Sparse Sets, Lowness and Highness
1986 · José L. Balcázar, Ronald V. Book, et al. · SIAM Journal on Computing · 72
On counting and approximation
2005 · Johannes Köbler, Uwe Schöning, et al. · Springer eBooks · 69
Instance complexity
1994 · Pekka Orponen, Ker-i Ko, et al. · Journal of the ACM · 65
PDF
Complete sets and closeness to complexity classes
1986 · Uwe Schöning · Theory of Computing Systems · 64
Complexity theory: current research
1993 · Klaus Ambos–Spies, Steven Homer, et al. · Cambridge University Press eBooks · 59
Reductions to sets of low information content
1992 · V. Arvind, Y. Han, et al. · Lecture notes in computer science · 55
Logic for Computer Scientists
2008 · Uwe Schöning · Birkhäuser Boston eBooks · 51
Immunity, Relativizations, and Nondeterminism
1984 · Uwe Schöning, Ronald V. Book · SIAM Journal on Computing · 47
Graph isomorphism is in the low hierarchy
2006 · Uwe Schöning · Springer eBooks · 46
Algorithmics in Exponential Time
2005 · Uwe Schöning · Lecture notes in computer science · 46
On counting and approximation
1989 · Johannes Köbler, Uwe Schöning, et al. · Acta Informatica · 43
The density and complexity of polynomial cores for intractable sets
1986 · Pekka Orponen, Uwe Schöning · Information and Control · 43
The Power of Counting
1990 · Uwe Schöning · Springer eBooks · 38
Works count: 167
Citation count: 3,111
H-index: 29
I10-index: 52
Year
Topic
Type