Skip to main content
SpringerLink
Log in

The complexity of the realization of subdefinite matrices by gate schemes

  • 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. O. B. Lupanov, “On gate- and compact-gate schemes,” Dokl. Akad. Nauk SSSR,111, No. 6, 1171–1174 (1956).

    Google Scholar 

  2. É. I. Nechiporuk, “On the complexity of gate schemes realizing Boolean matrices with subdefined elements,” Dokl. Akad. Nauk SSSR,163, No. 1, 40–42 (1965).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. M. V. Lomonosov Moscow State University, USSR

    A. E. Andreev

Authors
  1. A. E. Andreev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Matematicheskie Zametki, Vol. 41, No. 1, pp. 77–86, January, 1987.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Andreev, A.E. The complexity of the realization of subdefinite matrices by gate schemes. Mathematical Notes of the Academy of Sciences of the USSR 41, 48–54 (1987). https://doi.org/10.1007/BF01159529

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation