Skip to main content
SpringerLink
Log in

A method of constructing fast algorithms in the k-valued logic

  • Published:
Mathematical notes of the Academy of Sciences of the USSR Aims and scope Submit manuscript

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 the k-valued logic,” Tr. Mat. Inst. Akad. Nauk SSSR,51, 5–142 (1958).

    Google Scholar 

  2. A. Aho, J. Hopcroft, and J. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley (1974).

  3. A. Schonhage and V. Strassen, “Schnelle Multiplikation grosser Zahlen,” Computing,7, No. 3–4, 281–292 (1971).

    Google Scholar 

  4. N. R. Emel'yanov, “On complexity of the expressibility problem in multivalued logics,” Dokl. Akad. Nauk SSSR,282, No. 3, 525–529 (1985).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Moscow State University, USSR

    V. B. Alekseev & N. R. Emel'yanov

Authors
  1. V. B. Alekseev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N. R. Emel'yanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Matematicheskie Zametki, Vol. 38, No. 1, pp. 148–156, July, 1985.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Alekseev, V.B., Emel'yanov, N.R. A method of constructing fast algorithms in the k-valued logic. Mathematical Notes of the Academy of Sciences of the USSR 38, 595–600 (1985). https://doi.org/10.1007/BF01137475

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation