Author:
Räihä Kari-Jouko,Ukkonen Esko
Subject
General Computer Science,Theoretical Computer Science
Reference7 articles.
1. Bounds on the complexity of the longest common subsequence problem;Aho;J. ACM,1976
2. The complexity of theorem proving procedures;Cook;Proc. 3rd Annual ACM Symposium on Theory of Computing,1971
3. Computers and Intractability;Garey,1979
4. Reducibility among combinatorial problems;Karp,1972
5. The complexity of some problems on subsequences and supersequences;Maier;J. ACM,1978
Cited by
85 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献