Skip to main content
SpringerLink
Log in

Completeness criteria of permutation systems containing transpositions

  • 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. V. Yablonskii, “Functional constructions in k-valued logic,” Proc. V. A. Steklov Mathematics Institute [in Russian], Vol. 51, Moscow (1958).

  2. O. Ore, Theory of Graphs, AMS Colloquium Publications, Providence, R. I. (1962).

    Google Scholar 

  3. R. A. Bairamov, “On completeness in a symmetrical subgroup of finite degree,” in: Discrete Analysis, [in Russian], No. 8, Novosibirsk (1964).

Download references

Authors
  1. V. I. Klevachev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 6, pp. 143–144, November–December, 1972.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Klevachev, V.I. Completeness criteria of permutation systems containing transpositions. Cybern Syst Anal 8, 1042–1043 (1972). https://doi.org/10.1007/BF01068535

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation