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=Math.~Systems Theory AND Volume=29
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
NP
-creative sets: A new class of creative sets in
NP
M. Agrawal
,
S. Biswas
Math. Systems Theory
29
(5), 1996, pp. 487-505
Superlinear deterministic top-down tree transducers
G. Dányi
,
Z. Fülöp
Math. Systems Theory
29
(5), 1996, pp. 507-534
Strong self-reducibility precludes strong immunity
L.A. Hemaspaandra
,
M. Zimand
Math. Systems Theory
29
(5), 1996, pp. 535-548
Bounded dilation maps of hypercubes into Cayley graphs on the symmetric group
Z. Miller
,
D. Pritikin
,
I.H. Sudborough
Math. Systems Theory
29
(6), 1996, pp. 551-572
The bounded membership problem of the monoid
SL_2(N)
J. Cai
,
Z. Liu
Math. Systems Theory
29
(6), 1996, pp. 573-587
Node bisectors of Cayley graphs
S.R. Blackburn
Math. Systems Theory
29
(6), 1996, pp. 589-598
Set-driven and rearrangement-independent learning of recursive languages
S. Lange
,
T. Zeugmann
Math. Systems Theory
29
(6), 1996, pp. 599-634
On digital nondeterminism
F. Cucker
,
M. Matamala
Math. Systems Theory
29
(6), 1996, pp. 635-647
Lower bounds for the majority communication complexity of various graph accessibility problems
C. Meinel
,
S. Waack
Math. Systems Theory
29
(6), 1996, pp. 649-659
Alternating time versus deterministic time: A separation
S. Gupta
Math. Systems Theory
29
(6), 1996, pp. 661-672
Seiten
<
1
2