Skip to main content
SpringerLink
Log in

Formalization of the class of problems solvable by a nondeterministic turing machine

  • 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. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass. (1974).

    MATH  Google Scholar 

  2. E. N. Gordeev, “Choice problems and their solution,” in: The Computer and Choice Problems [in Russian], Nauka, Moscow (1989), pp. 5–48.

    Google Scholar 

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

    MATH  Google Scholar 

  4. V. A. Emelichev and others. Lectures in Graph Theory [in Russian], Nauka, Moscow (1990).

    Google Scholar 

  5. V. K. Leont'ev, “Combinatorics: past achievements and future prospects,” in: The Computer and Choice Problems [in Russian], Nauka, Moscow (1989), pp. 49–88.

    Google Scholar 

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

    MATH  Google Scholar 

  7. E. M. Reingold, J. Nievergelt, and N. Deo, Combinatorial Algorithms: Theory and Practice, Prentice Hall, Englewood Cliffs, NJ (1977).

    Google Scholar 

  8. A. D. Plotnikov, “Normal form of extremal combinatorial problems,” Visnik VPÏ, 3(4), 73–76 (1994).

    Google Scholar 

Download references

Authors
  1. A. D. Plotnikov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika iSistemnyi Analiz, No. 5, pp. 30–36, September–October, 1997.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Plotnikov, A.D. Formalization of the class of problems solvable by a nondeterministic turing machine. Cybern Syst Anal 33, 635–640 (1997). https://doi.org/10.1007/BF02667185

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation