Skip to main content
SpringerLink
Log in

Method of determining lower bounds for the complexity of P-schemes

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

Abstract

A method of calculating lower bounds, quadratic in the arguments of the function, for the complexity of P-schemes.

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

Literature cited

  1. V. M. Khrapchenko, “The complexity of realizing linear functions in the class of P-schemes,” Matem. Zametki,9, No. 1, 35–40 (1970).

    Google Scholar 

  2. B. M. Kloss, “Estimates of the complexity of solutions of systems of linear equations,” Dokl. Akad. Nauk SSSR,171, No.4, 731–783 (1966).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Applied Mathematics, Academy of Sciences of the USSR, USSR

    V. M. Khrapchenko

Authors
  1. V. M. Khrapchenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Matematicheskie Zametki, Vol. 10, No. 1, pp. 83–92, July, 1971.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Khrapchenko, V.M. Method of determining lower bounds for the complexity of P-schemes. Mathematical Notes of the Academy of Sciences of the USSR 10, 474–479 (1971). https://doi.org/10.1007/BF01747074

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation