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: Author="Lewis, F.D."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A note on context free languages, complexity classes, and diagonalization
F.D. Lewis
Math. Systems Theory
14
, 1981, pp. 223-227
Complex properties of grammars
F.G. Abramson
,
Y. Breitbart
,
F.D. Lewis
Journal of the ACM
27
(3), 1980, pp. 484-498
On computational reducibility
F.D. Lewis
Journal of Computer and System Sciences
12
, 1976, pp. 122-131
The enumerability and invariance of complexity classes
F.D. Lewis
Journal of Computer and System Sciences
5
, 1971, pp. 286-303
Decision problems for complexity classes of computable functions
F.D. Lewis
Proceedings of the 2nd Annual ACM Symposium on Theory of Computing, STOC'70 (Northampton, MA, May 4-6, 1970)
, 1970, pp. 22-30
Unsolvability considerations in computational complexity
F.D. Lewis
Proceedings of the 2nd Symp. Theory of Computation