A fast algorithm for the string editing problem and decision graph complexity
暂无分享,去创建一个
[1] Robert A. Wagner,et al. An Extension of the String-to-String Correction Problem , 1975, JACM.
[2] E. T.. An Introduction to the Theory of Numbers , 1946, Nature.
[3] A WagnerRobert,et al. An Extension of the String-to-String Correction Problem , 1975 .
[4] Walter J. Savitch,et al. Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..
[5] Chak-Kuen Wong,et al. Bounds for the String Editing Problem , 1976, JACM.
[6] Michael J. Fischer,et al. The String-to-String Correction Problem , 1974, JACM.
[7] Neil D. Jones,et al. Complete problems for deterministic polynomial time , 1974, STOC '74.
[8] Alfred V. Aho,et al. Bounds on the Complexity of the Longest Common Subsequence Problem , 1976, J. ACM.
[9] Michael A. Harrison,et al. Introduction to switching and automata theory , 1965 .