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="Ko, K.-I."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Separating and collapsing results on the relativized probabilistic polynomial-time hierarchy
K.-I. Ko
Journal of the ACM
37
(2), 1990, April, pp. 415-438
On the continued fraction representation of computable real numbers
K.-I. Ko
Theoretical Computer Science
54
(2-3), 1987, October, pp. 341-343
A note on one-way functions and polynomial-time isomorphisms
K.-I. Ko
,
T.J. Long
,
D.-Z. Du
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, STOC'86 (Berkeley, CA, May 28-30, 1986)
, 1986, pp. 295-303
On the notion of infinite pseudorandom sequences
K.-I. Ko
Theoretical Computer Science
48
(1), 1986, pp. 9-33
Computational complexity of real functions (in Fundamental Studies)
K.-I. Ko
,
H. Friedman
Theoretical Computer Science
20
, 1982, pp. 323-352
Some observations on the probabilistic algorithms and NP-hard problems
K.-I. Ko
Information Processing Letters
14
(1), 1982, March, pp. 39-43
The maximum value problem and NP real numbers
K.-I. Ko
Journal of Computer and System Sciences
24
(1), 1982, February, pp. 15-35
Completeness, approximation and density
K.-I. Ko
,
D. Moore
SIAM Journal on Computing
10
(4), 1981, November, pp. 787-796