Skip to main content
SpringerLink
Log in

Concerning existential definition of the classnp: Theoretical analysis of an alternative approach

  • Published:
Cybernetics and Systems Analysis Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Nauka, Moscow (1986).

    Google Scholar 

  2. V. A. Uspenskii, Lectures on Computable Functions [in Russian], Fizmatgiz, Moscow (1960).

    Google Scholar 

  3. B. A. Trakhtenbrot, Algorithms and Computing Automata [in Russian], Nauka, Moscow (1974).

    Google Scholar 

  4. H. Rogers, Theory of Recursive Functions and Effective Computability [Russian translation], Mir, Moscow (1972).

    Google Scholar 

  5. V. M. Glushkov, Theory of Algorithms [in Russian], KVIDU, PVO, Kiev (1961).

    Google Scholar 

  6. V. M. Glushkov, An Introduction to Cybernetics [in Russian], AN UkrSSR, Kiev (1964).

    Google Scholar 

  7. C.C. Chang and H. J. Keisler, Model Theory [Russian translation], Mir, Moscow (1977).

    Google Scholar 

  8. A. Gross and A. Lanten, Formal Grammar Theory [Russian translation], Mir, Moscow (1971).

    Google Scholar 

  9. S. C. Kleene, Introduction to Metamathematics, Van Nostrand, New York (1952).

    Google Scholar 

  10. V. M. Glushkov, G. E. Tseitlin, and E. L. Yushchenko, Algebras, Languages, Programming [in Russian], Naukova Dumka, Kiev (1989).

    Google Scholar 

  11. R. M. Karp, “Reducibility of combinatorial problems,” Kib. Sb., new series, No. 12 [Russian translations], Mir, Moscow (1975).

    Google Scholar 

  12. M. R. Garey and D. S. Johnson, Computers and Intractability, Freeman, San Francisco (1979).

    Google Scholar 

  13. D. H. Younger, “Acceptance and analysis of context-free languages in time n3,” in: Topics in Mathematical Logic [Russian translations].

  14. A. Aho and J. Ullman, The Theory of Parsing, Translation, and Compiling, Vol. 1, Prentice Hall, Englewood Cliffs, NJ (1972).

    Google Scholar 

  15. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, Englewood Cliffs, NJ (1982).

    Google Scholar 

  16. N. Cutland, Computability: An Introduction to Recursive Function Theory, Cambridge Univ. Press (1980).

Download references

Authors
  1. O. V. German
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 15–25, September–October, 1998.

Rights and permissions

Reprints and permissions

About this article

Cite this article

German, O.V. Concerning existential definition of the classnp: Theoretical analysis of an alternative approach. Cybern Syst Anal 34, 645–652 (1998). https://doi.org/10.1007/BF02667036

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02667036

Keywords

Search

Navigation