Skip to main content
SpringerLink
Log in

Complexity of the Realization of a Linear Boolean Function in the Class of π-Schemes

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

Abstract

Using Khrapchenko’s method, we obtain the exact lower bound of 40 for the complexity in the class of π-schemes of a linear Boolean function depending substantially on 6 variables. We give a simplified proof of several lower bounds for the complexity of linear Boolean functions which are previously obtained on the basis of the same method.

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, “The Computation Complexity in the Class of Formulas,” Diskretn. Anal. Issled.Oper. 19 (3), 3–12 (2012) [J. Appl. Indust.Math. 6 (4), 403–409 (2012)].

    MathSciNet  MATH  Google Scholar 

  2. Yu. L. Vasil’ev and K. L. Rychkov, “A Lower Estimate for the Computation Complexity of a Ternary Linear Function,” Diskretn. Anal. Issled.Oper. 20 (4), 15–26 (2013) [J. Appl. Indust.Math. 7 (4), 588–596 (2013)].

    MathSciNet  MATH  Google Scholar 

  3. K. L. Rychkov, “A Modification of Khrapchenko’s Method and Its Application to Complexity Estimation of p-Schemes for Code Functions,” in Methods of Discrete Analysis in Theory of Graphs and Schemes, Vol. 42 (Inst. Mat., Novosibirsk, 1985), pp. 91–98.

    MATH  Google Scholar 

  4. K. L. Rychkov, “On the Lower Bounds for the Complexity of Serial-ParallelContact Circuits Realizing Linear Boolean Functions,” Sibir. Zh. Issled. Oper. 1 (4), 33–52 (1994) [in Discrete Analysis and Operations Research (Kluwer Acad. Publ., Dordrecht, 1996), pp. 217–234].

    MATH  Google Scholar 

  5. K. L. Rychkov, “Lower Bounds on the Formula Complexity of a Linear Boolean Function,” Sibir. Elektron. Mat. Izv. 11, 165–184 (2014).

    MathSciNet  MATH  Google Scholar 

  6. K. L. Rychkov, “SufficientConditions for the Local Repetition-Freeness of the Minimal p-Schemes Realizing Linear Boolean Functions,” Diskretn. Anal. Issled. Oper. 22 (5), 71–85 (2015) [J. Appl. Indust.Math. 9 (4), 580–587 (2015)].

    MATH  Google Scholar 

  7. B. A. Subbotovskaya, “Realization of Linear Functions by Formulas Using V, &, and -,” Dokl. Akad. Nauk SSSR 136 (3), 553–555 (1961) [Sov.Math. Dokl. 2, 110–112 (1961)].

    MathSciNet  MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  10. D. Yu. Cherukhin, “To the Question of a Logical Representation for the Parity Counter,” Neform. Nauka No. 2, 14–23 (2009).

    Google Scholar 

  11. S. V. Yablonskii, “Realization of a Linear Function in the Class of II-Circuits,” Dokl. Akad. Nauk SSSR, Nov. Ser. 94 (5), 805–806 (1954).

    Google Scholar 

  12. F. Harary, Graph theory (Reading, MA: Addison-Wesley, 1969).

    Book  MATH  Google Scholar 

  13. J. Håstad, “The Shrinkage Exponent of deMorgan Formulae is 2,” SIAMJ. Comput. 27 (1), 48–64 (1998).

    Article  Google Scholar 

  14. M. Karchmer and A. Wigderson, “Monotone Circuits for Connectivity Require Super-Logarithmics Depth,” SIAMJ. Discrete Math. 3 (2), 255–265 (1990).

    Article  MathSciNet  MATH  Google Scholar 

  15. T. Lee, “ANew Rank Technique for Formula Size Lower Bounds,” in STACS 2007. 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22–24, 2007, Proceedings Ed. by W. Thomas and P. Weil (Springer, Heidelberg, 2007), pp. 145–156.

    Google Scholar 

  16. A. Razborov, “Applications of Matrix Methods to the Theory of Lower Bounds in Computational Complexity,” Combinatorica 10 (1), 81–93 (1990).

    Article  MathSciNet  MATH  Google Scholar 

  17. P. Turán, “Eine Extremalaufgabe aus der Graphentheorie,” Mat. Fiz. Lapok. 48 (1), 436–452 (1941).

    MathSciNet  MATH  Google Scholar 

  18. I. Wegener, The Complexity of Boolean Functions (Wiley, Chichester, UK, 1987).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    K. L. Rychkov

Authors
  1. K. L. Rychkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to K. L. Rychkov.

Additional information

Original Russian Text © K.L. Rychkov, 2018, published in Diskretnyi Analiz i Issledovanie Operatsii, 2018, Vol. 25, No. 3, pp. 36–94.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Rychkov, K.L. Complexity of the Realization of a Linear Boolean Function in the Class of π-Schemes. J. Appl. Ind. Math. 12, 540–576 (2018). https://doi.org/10.1134/S1990478918030146

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation