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: Journal=Theor.~Comput.~Sci. AND Volume=271
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A characterization of c.e. random reals
Cristian S. Calude
Theoretical Computer Science
271
(1-2), 2002, pp. 3-14
Kolmogorov entropy in the context of computability theory
Andrej A. Muchnik
,
Semen Ye. Positselsky
Theoretical Computer Science
271
(1-2), 2002, pp. 15-35
Comparison between the complexity of a function and the complexity of its graph
Bruno Durand
,
Sylvain Porrot
Theoretical Computer Science
271
(1-2), 2002, pp. 37-46
Descriptive complexity of computable sequences
Bruno Durand
,
Alexander Shen
,
Nikolai Vereshchagin
Theoretical Computer Science
271
(1-2), 2002, pp. 47-58
Kolmogorov complexity conditional to large integers
Nikolai K. Vereshchagin
Theoretical Computer Science
271
(1-2), 2002, pp. 59-67
Upper semi-lattice of binary strings with the relation ``
x
is simple conditional to
y
''
Alexei Chernov
,
Andrej Muchnik
,
Andrei Romashchenko
,
Alexander Shen
,
Nikolai Vereshchagin
Theoretical Computer Science
271
(1-2), 2002, pp. 69-95
Conditional complexity and codes
Andrej A. Muchnik
Theoretical Computer Science
271
(1-2), 2002, pp. 97-109
Combinatorial interpretation of Kolmogorov complexity
A. Romashchenko
,
A. Shen
,
N. Vereshchagin
Theoretical Computer Science
271
(1-2), 2002, pp. 111-123
Logical operations and Kolmogorov complexity
Alexander Shen
,
Nikolai Vereshchagin
Theoretical Computer Science
271
(1-2), 2002, pp. 125-129
Independent minimum length programs to translate between given strings
Nikolai K. Vereshchagin
,
Michael V. Vyugin
Theoretical Computer Science
271
(1-2), 2002, pp. 131-143
Information distance and conditional complexities
Mikhail V. Vyugin
Theoretical Computer Science
271
(1-2), 2002, pp. 145-150
Kolmogorov complexity and non-determinism
Serge Grigorieff
,
Jean-Yves Marion
Theoretical Computer Science
271
(1-2), 2002, pp. 151-180
General linear relations between different types of predictive complexity
Yuri Kalnishkan
Theoretical Computer Science
271
(1-2), 2002, pp. 181-200