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="Ambos-Spies, K."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Minimal pairs and complete problems
K. Ambos-Spies
,
S. Homer
,
R.I. Soare
Lecture Notes in Computer Science
415
, 1990, pp. 24-36
Diagonalizations over polynomial time computable sets
K. Ambos-Spies
,
H. Fleischhack
,
H. Huwig
Theoretical Computer Science
51
(1-2), 1987, pp. 177-204
Honest polynomial reducibilities, recursively enumerable sets, and the
P=?NP
problem
K. Ambos-Spies
Proceedings of the 2nd Annual Conference on Structure in Complexity Theory, CSCT'87 (Cornell University, Ithaca, NY, June 16-19, 1987)
, 1987, pp. 60-68
An inhomogeneity in the structure of Karp degrees
K. Ambos-Spies
SIAM Journal on Computing
15
(4), 1986, November, pp. 958-963
A note on complete problems for complexity classes
K. Ambos-Spies
Information Processing Letters
23
(5), 1986, November, pp. 227-230
Inhomogeneities in the polynomial-time degrees: the degrees of super sparse sets
K. Ambos-Spies
Information Processing Letters
22
(3), 1986, March, pp. 113-117
Randomness, relativizations, and polynomial reducibilties
K. Ambos-Spies
Lecture Notes in Computer Science
223
, 1986, pp. 23-34
Sublattices of the polynomial time degrees
K. Ambos-Spies
Information and Control
65
(1), 1985, pp. 63-84
Three theorems on polynomial degrees of
NP
-sets
K. Ambos-Spies
Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, FOCS'85 (Portland, OR, October 21-23, 1985)
, 1985, pp. 51-55
P-generic sets
K. Ambos-Spies
,
H. Fleischhack
,
H. Huwig
Lecture Notes in Computer Science
172
, 1984, pp. 58-68
On the structure of polynomial time degrees
K. Ambos-Spies
Lecture Notes in Computer Science
166
, 1984, pp. 198-208