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="Wagner, Klaus W."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Perfect correspondences between dot-depth and polynomial-time hierarchies
Christian Glaßer
,
Stephen Travers
,
Klaus W. Wagner
Journal of Computer and System Sciences
80
(7), 2014, pp. 1359-1373
The complexity of unions of disjoint sets
Christian Glaßer
,
Alan L. Selman
,
Stephen Travers
,
Klaus W. Wagner
Journal of Computer and System Sciences
74
(7), 2008, pp. 1173-1187
The Boolean hierarchy of
NP
-partitions
Sven Kosub
,
Klaus W. Wagner
Information and Computation
206
(5), 2008, pp. 538-568
The complexity of unions of disjoint sets
Christian Glaßer
,
Alan L. Selman
,
Stephen Travers
,
Klaus W. Wagner
Lecture Notes in Computer Science
4393
, 2007, pp. 248-259
The complexity of computing the size of an interval
Lane A. Hemaspaandra
,
Christopher M. Homan
,
Sven Kosub
,
Klaus W. Wagner
SIAM Journal on Computing
36
(5), 2006-2007, pp. 1264-1300
A reducibility for the dot-depth hierarchy
Victor L. Selivanov
,
Klaus W. Wagner
Theoretical Computer Science
345
(2-3), 2005, pp. 448-472
Arithmetic circuits and polynomial replacement systems
Pierre McKenzie
,
Heribert Vollmer
,
Klaus W. Wagner
SIAM Journal on Computing
33
(6), 2004, pp. 1513-1531
A reducibility for the dot-depth hierarchy
Victor L. Selivanov
,
Klaus W. Wagner
Lecture Notes in Computer Science
3153
, 2004, pp. 783-793
The complexity of membership problems for circuits over sets of natural numbers
Pierre McKenzie
,
Klaus W. Wagner
Lecture Notes in Computer Science
2607
, 2003, pp. 571-582
The complexity of computing the size of an interval
Lane A. Hemaspaandra
,
Sven Kosub
,
Klaus W. Wagner
Lecture Notes in Computer Science
2076
, 2001, pp. 1040-1051
On Boolean lowness and Boolean highness
Steffen Reith
,
Klaus W. Wagner
Theoretical Computer Science
261
(2), 2001, pp. 305-321
The Boolean hierarchy of
NP
-partitions
Sven Kosub
,
Klaus W. Wagner
Lecture Notes in Computer Science
1770
, 2000, pp. 157-168
Arithmetic circuits and polynomial replacement systems
Pierre McKenzie
,
Heribert Vollmer
,
Klaus W. Wagner
Lecture Notes in Computer Science
1974
, 2000, pp. 164-175
Characterizing small depth and small space classes by operators of higher types
Manindra Agrawal
,
Eric Allender
,
Samir Datta
,
Heribert Vollmer
,
Klaus W. Wagner
Technical Report (TR98-057), 1998, September
Bounding queries in the analytic polynomial-time hierarchy
Herbert Baier
,
Klaus W. Wagner
Theoretical Computer Science
207
(1), 1998, pp. 89-104
On Boolean lowness and Boolean highness
Steffen Reith
,
Klaus W. Wagner
Lecture Notes in Computer Science
1449
, 1998, pp. 147-156
A note on parallel queries and the symmetric-difference hierarchy
Klaus W. Wagner
Information Processing Letters
66
(1), 1998, pp. 13-20
On operators of higher types
Heribert Vollmer
,
Klaus W. Wagner
Proceedings of the 12th Annual IEEE Conference on Computational Complexity (Ulm, Germany, June 24-27, 1997)
, 1997, pp. 174-184
On type-2 probabilistic quantifiers
Ronald V. Book
,
Heribert Vollmer
,
Klaus W. Wagner
Lecture Notes in Computer Science
1099
, 1996, pp. 369-380
On the power of DNA-computing
Diana Rooß
,
Klaus W. Wagner
Information and Computation
131
(2), 1996, pp. 95-109
Recursion theoretic characterizations of complexity classes of counting functions
Heribert Vollmer
,
Klaus W. Wagner
Theoretical Computer Science
163
(1-2), 1996, pp. 245-258
On the power of number-theoretic operations with respect to counting
Ulrich Hertrampf
,
Heribert Vollmer
,
Klaus W. Wagner
Proceedings of the Tenth Annual Conference on Structure in Complexity Theory (Minneapolis, Minnesota, June 19-22, 1995)
, 1995, pp. 299-314
Complexity classes of optimization functions
Heribert Vollmer
,
Klaus W. Wagner
Information and Computation
120
(2), 1995, pp. 198-219
An observation on probability versus randomness with applications to complexity classes
Ronald V. Book
,
Jack H. Lutz
,
Klaus W. Wagner
Math. Systems Theory
27
(3), 1994, pp. 201-209
Einführung in die theoretische Informatik: Grundlagen und Modelle
Klaus W. Wagner
Buch, 1994, pp. X, 238
Seiten 1
2
>