On Reducibility to Complex or Sparse Sets
暂无分享,去创建一个
[1] Nancy A. Lynch,et al. “Helping”: several formalizations , 1975, Journal of Symbolic Logic.
[2] Journal of the Association for Computing Machinery , 1961, Nature.
[3] N. A. Lynch. RELATIVIZATION OF THE THEORY OF COMPUTATION COMPLEXITY , 1972 .
[4] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[5] Albert R. Meyer,et al. WEAK MONADIC SECOND ORDER THEORY OF SUCCESSOR IS NOT ELEMENTARY-RECURSIVE , 1973 .
[6] Nancy A. Lynch. Complexity-Class-Encoding Sets , 1976, J. Comput. Syst. Sci..