On the Approximation of Finding Various Minimal, Maximal, and Consistent Sequences
暂无分享,去创建一个
[1] Tao Jiang,et al. On the Complexity of Learning Strings and Sequences , 1993, Theor. Comput. Sci..
[2] V. G. Timkovskii. Complexity of common subsequence and supersequence problems and related problems , 1989 .
[3] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[4] Leslie G. Valiant,et al. A theory of the learnable , 1984, STOC '84.
[5] Martin Middendorf. The Shortest Common Nonsubsequence Problem is NP-Complete , 1993, Theor. Comput. Sci..
[6] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[7] David Maier,et al. The Complexity of Some Problems on Subsequences and Supersequences , 1978, JACM.
[8] Esko Ukkonen,et al. The Shortest Common Supersequence Problem over Binary Alphabet is NP-Complete , 1981, Theor. Comput. Sci..
[9] Leslie G. Valiant,et al. Computational limitations on learning from examples , 1988, JACM.
[10] Tao Jiang,et al. On the Approximation of Shortest Common Supersequences and Longest Common Subsequences , 1994, SIAM J. Comput..