An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations
暂无分享,去创建一个
[1] Dan Archdeacon,et al. A Kuratowski theorem for the projective plane , 1981, J. Graph Theory.
[2] E. C. Milner. Basic WQO- and BQO-Theory , 1985 .
[3] Paul D. Seymour,et al. Graph minors. V. Excluding a planar graph , 1986, J. Comb. Theory B.
[4] Michael R. Fellows,et al. Nonconstructive Advances in Polynomial-Time Complexity , 1987, Inf. Process. Lett..
[5] Stephen T. Hedetniemi,et al. Linear algorithms on k-terminal graphs , 1987 .
[6] Michael R. Fellows,et al. Nonconstructive tools for proving polynomial-time decidability , 1988, JACM.
[7] Michael R. Fellows,et al. On search decision and the efficiency of polynomial-time algorithms , 1989, STOC '89.
[8] M. A. Langston,et al. Obstruction set isolation for layout permutation problems , 1989 .