Author:
Hemaspaandra Lane A.,Ogihara Mitsunori,Zaki Mohammed J.,Zimand Marius
Publisher
Springer Berlin Heidelberg
Reference34 articles.
1. Bertoni, A., Goldwurm, M., Sabadini, N.: The complexity of computing the number of strings of given length in context-free languages. Theoretical Computer Science 86(2), 325–342 (1991)
2. Denny-Brown, D., Han, Y., Hemaspaandra, L., Torenvliet, L.: Semi-membership algorithms: Some recent advances. SIGACT News 25(3), 12–23 (1994)
3. Goldberg, A., Sipser, M.: Compression and ranking. SIAM Journal on Computing 20(3), 524–536 (1991)
4. Gurevich, Y.: Algebras of feasible functions. In: Proceedings of the 24th IEEE Symposium on Foundations of Computer Science, pp. 210–214. IEEE Computer Society Press, Los Alamitos (1983)
5. Lecture Notes in Computer Science;J. Hartmanis,1985
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献