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=137
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A typed
\lambda
-calculus for proving-by-example and bottom-up generalization procedure
Masami Hagiya
Theoretical Computer Science
137
(1), 1995, pp. 3-23
Case-based representation and learning of pattern languages
Klaus P. Jantke
,
Steffen Lange
Theoretical Computer Science
137
(1), 1995, pp. 25-51
Towards a mathematical theory of machine discovery from facts
Yasuhito Mukouchi
,
Setsuo Arikawa
Theoretical Computer Science
137
(1), 1995, pp. 53-84
On aggregating teams of learning machines
Sanjay Jain
,
Arun Sharma
Theoretical Computer Science
137
(1), 1995, pp. 85-108
On the
VC
-dimension of depth four treshold circuits and the complexity of boolean-valued functions
Akito Sakurai
Theoretical Computer Science
137
(1), 1995, pp. 109-127
Complexity of computing Vapnik-Chervonenkis dimension and some generalized dimensions
Ayumi Shinohara
Theoretical Computer Science
137
(1), 1995, pp. 129-144
\varepsilon
-approximations of
k
-label spaces
Susuma Hasegawa
,
Hiroshi Imai
,
Masaki Ishiguro
Theoretical Computer Science
137
(1), 1995, pp. 145-157
Exact learning of linear combinations of monotone terms from function value queries
Atsuyoshi Nakamura
,
Naoki Abe
Theoretical Computer Science
137
(1), 1995, pp. 159-176
Valuations of languages, with applications to fractal geometry
Henning Fernau
Theoretical Computer Science
137
(2), 1995, pp. 177-217
Substitutions et
\beta
-systèmes de numération
Stéphane Fabre
Theoretical Computer Science
137
(2), 1995, pp. 219-236
Equational properties of Kleene algebras of relations with conversion
Z. Ésik
,
L. Bernátsky
Theoretical Computer Science
137
(2), 1995, pp. 237-251
Mathematical games: Mixed searching and proper-path-width
Atsushi Takahashi
,
Shuichi Ueno
,
Yoji Kajitani
Theoretical Computer Science
137
(2), 1995, pp. 253-268
Fast parallel string prefix-matching
Dany Breslauer
Theoretical Computer Science
137
(2), 1995, pp. 269-278
If
NP
has polynomial-size curcuits, then
MA=AM
Vikraman Arvind
,
Johannes Köbler
,
Uwe Schöning
,
Rainer Schuler
Theoretical Computer Science
137
(2), 1995, pp. 279-282