Advertisement

Bounds on computational complexity and approximability of initial segments of recursive sets

  • M. I. Dekhtjar
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 74)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Dekhtjar, M.I., On the complexity of approximation of recursive sets, EIK, 12 (1976), 3, 115–122.Google Scholar
  2. 2.
    Trakhtenbrot, B.A., Complexity of algorithms and computations, Novosibirsk State University, Novosibirsk, 1967.Google Scholar
  3. 3.
    Agafonov, V.N., Complexity of algorithms and computations, II, Novosibirsk State University, Novosibirsk, 1975.Google Scholar
  4. 4.
    Freidzon, R.I., Regular approximation of recursive predicates, Zap. nauchn. sem. Leningradskogo otd. Mat. Inst. Steklova, 20 (1971), 220–223.Google Scholar
  5. 5.
    Trakhtenbrot, B.A., Optimal computations and frequency phenomenon of Jablonsky, Algebra and logic, 4 (1965), 5, 79–93.Google Scholar
  6. 6.
    Dekhtjar, M.I., Complexity spectra of recursive sets and approximability of initial segments of complete problems, EIK, 15 (1979), 1/2, 11–32.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • M. I. Dekhtjar
    • 1
  1. 1.Institute of MathematicsNovosibirskUSSR

Personalised recommendations