Author:
Bertoni Alberto,Mereghetti Carlo,Pighizzini Giovanni
Publisher
Springer Berlin Heidelberg
Reference31 articles.
1. E. Allender, D. Bruschi, and G. Pighizzini. The complexity of computing maximal word functions. Technical Report 92-15, DIMACS, 1992. To appear in Computational Complexity.
2. C. Àlvarez and B. Jenner. A very hard log-space counting class. Theoretical Computer Science, 107:3–30, 1993.
3. H. Alt and K. Mehlhorn. A language over a one symbol alphabet requiring only O(log log n) space. SIGACT news, 7:31–33, 1975.
4. J. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I. Springer Verlag, 1987.
5. A. Bertoni and M. Goldwurm. On ranking 1-way finitely ambiguous NL languages and #P 1-complete census functions. RAIRO Inf. Theor., 27:135–148, 1993.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献