Opening book details…
About this scholarly article
15th Annual Symposium on Switching and Automata Theory (swat 1974) - Bounds on the complexity of the longest common subsequence problem by Aho, A. V.; Hirschberg, D. S.; Ullman, J. D. is a scholarly article available to read on EtoBox.
- Author
- Aho, A. V.; Hirschberg, D. S.; Ullman, J. D.
- Publisher
- IEEE
- Published
- 1974
- Language
- EN
More by Aho, A. V.; Hirschberg, D. S.; Ullman, J. D.
Browse all works by Aho, A. V.; Hirschberg, D. S.; Ullman, J. D.