Skip to main content
SpringerLink
Log in

A lower estimate for the computation complexity of a ternary linear function

  • Published:
Journal of Applied and Industrial Mathematics Aims and scope Submit manuscript

Abstract

The computation complexity of a ternary linear function of n variables is found to be at least \(n^2 + \tfrac{3} {2}n - o(n)\).

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. S. V. Avgustinovich, Yu. L. Vasil’ev, and K. L. Rychkov, “Computation Complexity of a Ternary Linear Function,” Diskret. Anal. Isled. Oper. 19(3), 3–12 (2012) [J. Appl. Indust. Math. 6 (4), 403–409 (2012)].

    MathSciNet  Google Scholar 

  2. G. P. Gavrilov and A. A. Sapozhenko, Problems and Exercises in Discrete Mathematics (Fizmatlit, Moscow, 2005) [in Russian].

    Google Scholar 

  3. K. L. Rychkov, “A Modification of V. M. Khrapchenko’s Method and Its Application to the Complexity Estimates of π-Circuits for Code Functioins,” Diskretn. Anal. 42, 91–98 (1985).

    MathSciNet  MATH  Google Scholar 

  4. K. L. Rychkov, “On Lower Bounds for the Complexity of Parallel-Serial Contact Circuits Realizing Linear Boolean Functions,” Sibirsk. Zh. Issled. Oper. 1(4), 33–52 (1994).

    MathSciNet  MATH  Google Scholar 

  5. K. L. Rychkov, “On Complexity of Generalized Contact Circuits,” Diskretn. Anal. Isled. Oper. 16(5), 78–87 (2009).

    MathSciNet  MATH  Google Scholar 

  6. K. L. Rychkov, “A Lower Bound for the Computation Complexity of a q-Ary Counter of Multiplicity Q in the Class of π-Circuits,” Diskretn. Anal. Isled.Oper. 17(6), 68–76 (2010) [J. Appl. Indust.Math. 5 (2), 290–295 (2011)].

    MATH  Google Scholar 

  7. V. M. Khrapchenko, “Complexity of the Realization of a Linear Function in the Class of π-Circuits,” Mat. Zametki 9(1), 35–40 (1971) [Math. Notes Acad. Sci. USSR 9 (1), 21–23 (1971)].

    MathSciNet  MATH  Google Scholar 

  8. V. M. Khrapchenko, “Method of Determining Lower Bounds for the Complexity of π-Schemes,” Mat. Zametki 10(1), 83–92 (1971) [Math. Notes Acad. Sci. USSR 10 (1), 474–479 (1971)].

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, pr. Akad. Koptyuga 4, Novosibirsk, 630090, Russia

    Yu. L. Vasil’ev & K. L. Rychkov

Authors
  1. Yu. L. Vasil’ev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. L. Rychkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yu. L. Vasil’ev.

Additional information

Original Russian Text © Yu.L. Vasil’ev, K.L. Rychkov, 2013, published in Diskretnyi Analiz i Issledovanie Operatsii, 2013, Vol. 20, No. 4, pp. 15–26.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vasil’ev, Y.L., Rychkov, K.L. A lower estimate for the computation complexity of a ternary linear function. J. Appl. Ind. Math. 7, 588–596 (2013). https://doi.org/10.1134/S1990478913040133

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1990478913040133

Keywords

Search

Navigation