Skip to main content
SpringerLink
Log in

Functional approach to the Hamiltonian circuit and graph isomorphism problems

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

The aim of this work is to establish a relation between the well-known basic problems of cryptanalysis, the Hamiltonian circuit problem and the graph isomorphism problem, and the global optimization problem for classes of functionals constructed as sums of low-dimensional polynomials. Bibiligraphy: 2 titles.

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

Similar content being viewed by others

References

  1. M. Blum, “How to prove a theorem so no one else can claim it,” in: Proceedings of the International Congress of Methematicians, Berkeley (1986), pp. 1444–1451.

  2. O. Coldreich, “Proof that yield nothing but their validity or all languages in NP have zero-knowledge proof systems,” J. ACM, 38, No. 3, 691–729 (1991).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Omsk State Technical University, Omsk, Russia

    R. T. Faizullin

Authors
  1. R. T. Faizullin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to R. T. Faizullin.

Additional information

Published in Zapiski Nauchnykh Seminarov POMI, Vol. 373, 2009, pp. 290–294.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Faizullin, R.T. Functional approach to the Hamiltonian circuit and graph isomorphism problems. J Math Sci 168, 475–477 (2010). https://doi.org/10.1007/s10958-010-9999-5

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-010-9999-5

Keywords

Search

Navigation