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=288
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Notations for exponentiation
Arnold Beckmann
Theoretical Computer Science
288
(1), 2002, pp. 3-19
Complexity measures and decision tree complexity: A survey
Harry Buhrman
,
Ronald de Wolf
Theoretical Computer Science
288
(1), 2002, pp. 21-43
Streams and strings in formal proofs
A. Carbone
Theoretical Computer Science
288
(1), 2002, pp. 45-83
On the Hamming distance of constraint satisfaction problems
P. Crescenzi
,
G. Rossi
Theoretical Computer Science
288
(1), 2002, pp. 85-100
On the complexity of data disjunctions
Thomas Eiter
,
Helmut Veith
Theoretical Computer Science
288
(1), 2002, pp. 101-128
Guarded fixed point logics and the monadic theory of countable trees
Erich Grädel
Theoretical Computer Science
288
(1), 2002, pp. 129-152
Lower bounds for invariant queries in logics with counting
Leonid Limsoon Wong Libkin
Theoretical Computer Science
288
(1), 2002, pp. 153-180
On an optimal propositional proof system and the structure of easy subsets of TAUT
Zenon Sadowski
Theoretical Computer Science
288
(1), 2002, pp. 181-193
The consistency dimension and distribution-dependent learning from queries
José L. Balcázar
,
Jorge Castro
,
David Guijarro
,
Hans-Ulrich Simon
Theoretical Computer Science
288
(2), 2002, pp. 197-215
Predicting nearly as well as the best pruning of a planar decision graph
Eiji Takimoto
,
Manfred K. Warmuth
Theoretical Computer Science
288
(2), 2002, pp. 217-235
On learning unions of pattern languages and tree patterns in the mistake bound model
Sally A. Goldman
,
Stephen S. Kwek
Theoretical Computer Science
288
(2), 2002, pp. 237-254
PAC learning with nasty noise
Nader H. Bshouty
,
Nadav Eiron
,
Eyal Kushilevitz
Theoretical Computer Science
288
(2), 2002, pp. 255-275
On the learning of incremental learning
Steffen Lange
,
Gunter Grieser
Theoretical Computer Science
288
(2), 2002, pp. 277-307
Learning classes of approximations to non-recursive functions
Frank Stephan
,
Thomas Zeugmann
Theoretical Computer Science
288
(2), 2002, pp. 309-341