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
[1]
Hilfe
Suche: Journal=J. Comput.~Syst.~Sci. AND Volume=54
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Counting quantifiers, successor relations, and logarithmic space
Kousha Etessami
Journal of Computer and System Sciences
54
(3), 1997, pp. 400-411
The isomorphism conjecture holds and one-way functions exist relative to an oracle
John Rogers
Journal of Computer and System Sciences
54
(3), 1997, pp. 412-423
Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals
James S. Royer
Journal of Computer and System Sciences
54
(3), 1997, pp. 424-436
On
P
-immunity of exponential time complete sets
Nicholas Tran
Journal of Computer and System Sciences
54
(3), 1997, pp. 437-440
The expressive powers of stable models for bound and unbound DATALOG queries
Domenico SaccĂ
Journal of Computer and System Sciences
54
(3), 1997, pp. 441-464
On fixed-parameter tractability and approximability of
NP
optimization problems
Liming Cai
,
Jianer Chen
Journal of Computer and System Sciences
54
(3), 1997, pp. 465-474
Geometric approach for optimal routing on a mesh with buses
Yosi Ben-Asher
,
Ilan Newman
Journal of Computer and System Sciences
54
(3), 1997, pp. 475-486
A model of interactive teaching
H. David Mathias
Journal of Computer and System Sciences
54
(3), 1997, pp. 487-501
A completeness theorem for the expressive power of higher-order algebraic specifications
Karl Meinke
Journal of Computer and System Sciences
54
(3), 1997, pp. 502-519
Seiten
<
1
2