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=Inf.~Comput. AND Volume=153
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Hilbert function and complexity lower bounds for symmetric Boolean functions
Anna Bernasconi
,
Lavinia Egidi
Information and Computation
153
(1), 1999, pp. 1-25
On the complexity of learning for spiking neurons with temporal coding
Wolfgang Maass
,
Michael Schmitt
Information and Computation
153
(1), 1999, pp. 26-46
The Kleene-Schützenberger theorem for formal power series in partially commuting variables
Manfred Droste
,
Paul Gastin
Information and Computation
153
(1), 1999, pp. 47-80
Complexity and expressive power of deterministic semantics for DATALOG
\neg
Sergio Greco
,
Domenico Saccà
Information and Computation
153
(1), 1999, pp. 81-98
Finite queries do not have effective syntax
Alexei P. Stolboushkin
,
Michael A. Taitslin
Information and Computation
153
(1), 1999, pp. 99-116
The power of multiobjects
Yehuda Afek
,
Michael Merritt
,
Gadi Taubenfeld
Information and Computation
153
(1), 1999, pp. 117-138
Recursive computational depth
James I. Lathrop
,
Jack H. Lutz
Information and Computation
153
(2), 1999, pp. 139-172
Basic theory of
F
-bounded quantification
Paolo Baldan
,
Giorgio Ghelli
,
Alessandra Raffaetà
Information and Computation
153
(2), 1999, pp. 173-237
Robust behaviorally correct learning
Sanjay Jain
Information and Computation
153
(2), 1999, pp. 238-248