Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Sch{\"o}ning, U."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A probabilistic algorithm for
k
-SAT based on limited local search and restart
U. Schöning
Algorithmica
32
(4), 2002, pp. 615-623
Complexity of Presburger arithmetic with fixed quantifier dimension
U. Schöning
Theory of Computing Systems
30
(4), 1997, pp. 423-428
Reductions to sets of low information content
V. Arvind
,
Y. Han
,
L. Hemachandra
,
J. Köbler
,
A. Lozano
,
M. Mundhenk
,
M. Ogiwara
,
U. Schöning
,
R. Silvestri
,
T. Thierauf
Lecture Notes in Computer Science
623
, 1992, pp. 162-173
Turing machines with few accepting computations and low sets for PP
J. Köbler
,
U. Schöning
,
S. Toda
,
J. Torán
Proceedings of the 4th Annual Conference on Structure in Complexity Theory, CSCT'89 (University of Oregon, Eugene, Oregon, June 19-22, 1989)
, 1989, pp. 208-215
Reductions to sets of low information content
V. Arvind
,
Y. Han
,
L. Hemachandra
,
J. Köbler
,
A. Lozano
,
M. Mundhenk
,
M. Ogiwara
,
U. Schöning
,
R. Silvestri
,
T. Thierauf
Complexity Theory: Current Research, 1988, pp. 1-45
Collapsing oracle hierarchies, census functions and logarithmically many queries
U. Schöning
,
K.W. Wagner
Lecture Notes in Computer Science
294
, 1988, pp. 91-97
Robust oracle machines
U. Schöning
Lecture Notes in Computer Science
324
, 1988, pp. 93-106
The power of counting
U. Schöning
Proceedings of the 3rd Annual Conference on Structure in Complexity Theory, CSCT'88 (Georgetown University, Washington D.C., June 14-17 1988)
, 1988, pp. 2-9
Graph isomorphism is in the low hierarchy
U. Schöning
Lecture Notes in Computer Science
247
, 1987, pp. 114-124
Probabilistic complexity classes and lowness
U. Schöning
Proceedings of the 2nd Annual Conference on Structure in Complexity Theory, CSCT'87 (Cornell University, Ithaca, NY, June 16-19, 1987)
, 1987, pp. 2-8
The polynomial-time hierarchy and sparse oracles
J.L. Balcázar
,
R.V. Book
,
U. Schöning
Journal of the ACM
33
(3), 1986, pp. 603-617
Sparse sets, lowness and highness
J.L. Balcázar
,
R.V. Book
,
U. Schöning
SIAM Journal on Computing
15
(3), 1986, August, pp. 739-747
Optimal approximations and polynomially levelable sets
P. Orponen
,
D.A. Russo
,
U. Schöning
SIAM Journal on Computing
15
(2), 1986, May, pp. 399-408
The density and complexity of polynomial cores for intractable sets
P. Orponen
,
U. Schöning
Information and Control
70
(1), 1986, pp. 54-68
On bounded query machines
J.L. Balcázar
,
R.V. Book
,
U. Schöning
Theoretical Computer Science
40
(2,3), 1985, pp. 237-243
On circuit-size complexity and the low hierarchy in NP
Ker-I Ko
,
U. Schöning
SIAM Journal on Computing
14
(1), 1985, February, pp. 41-51
Polynomial levelability and maximal complexity cores
P. Orponen
,
D.A. Russo
,
U. Schöning
Lecture Notes in Computer Science
194
, 1985, pp. 435-444
Robust algorithms: A different approach to oracles
U. Schöning
Theoretical Computer Science
40
(1), 1985, pp. 57-66
Sparse oracles and uniform complexity classes
J. Balcázar
,
R. Book
,
T. Long
,
U. Schöning
,
A. Selman
Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, FOCS'84 (Singer Island, FL, October 24-26, 1984)
, 1984, pp. 308-311
Minimal pairs for P
U. Schöning
Theoretical Computer Science
31
(1,2), 1984, pp. 41-48
On small generators
U. Schöning
Theoretical Computer Science
34
(3), 1984, pp. 337-341
Robust algorithms: A different approach to oracles
U. Schöning
Lecture Notes in Computer Science
172
, 1984, pp. 448-453
On the structure of
\Delta_2^P
U. Schöning
Information Processing Letters
16
(4), 1983, May, pp. 209-211
A low and a high hierarchy within
NP
U. Schöning
Journal of Computer and System Sciences
27
(1), 1983, August, pp. 14-28