Skip to main content
SpringerLink
Log in

Universality of a class of quadratic integer problems

  • Brief Communications
  • Published:
Cybernetics 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

Literature Cited

  1. S. A. Cook, “Complexity of theorem proving procedures,” in: Proceedings of the Third Annual ACM Symposium on Theory of Computing (1971).

  2. R. M. Karp, “Reducibility among combinatorial problems,” in: Proceedings of the IBM Symposium on Complexity of Computer Computations, Plenum Press, New York (1972).

    Google Scholar 

  3. C. Berge, The Theory of Graphs and Its Application, Methuen, London (1962).

    Google Scholar 

Download references

Authors
  1. V. A. Trubin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 2, p. 147, March–April, 1977.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Trubin, V.A. Universality of a class of quadratic integer problems. Cybern Syst Anal 13, 304–305 (1977). https://doi.org/10.1007/BF01073328

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation