Skip to main content
SpringerLink
Log in

Sufficient conditions for the local repetition-freeness of minimal π-schemes realizing linear Boolean functions

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

Abstract

We formulate some sufficient conditions for the local repetition-freeness of the minimal π-schemes realizing linear Boolean functions. The fulfillment of these conditions leads to description of the classes of minimal π-schemes that realize the linear Boolean functions depending essentially on n variables.

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. K. L. Rychkov, “Modification of Khrapchenko’s Method and Its Application to Estimation of Complexity of π-Schemes for Code Functions,” in Methods of Discrete Analysis in the Theory of Graphs and Schemes, Vol. 42 (Inst. Mat., Novosibirsk, 1985), pp. 91–98.

    Google Scholar 

  2. K. L. Rychkov, “OnMinimal π-Schemes for LinearBoolean Functions,” in Methods ofDiscrete Analysis in Synthesis of Schemes for Boolean Functions, Vol. 51 (Inst. Mat., Novosibirsk, 1991), pp. 84–104 [Siberian Adv. Math. 3, No. 3, 172–185 (1993)].

    Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  5. 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)].

    MATH  MathSciNet  Google Scholar 

  6. 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)].

    MATH  MathSciNet  Google Scholar 

  7. D. Yu. Cherukhin, “To theQuestion of a Logical Representation for the ParityCounter,” Neformalnaya Nauka No. 2, 14–23 (2009).

    Google Scholar 

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

    MathSciNet  Google Scholar 

  9. J. Hastad, “The Shrinkage Exponent of de Morgan Formulas is 2,” SIAM J. Comput. 27 (1), 48–64 (1998).

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  12. I. Wegener, The Complexity of Boolean Functions (Wiley, Chichester, 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, 2015, published in Diskretnyi Analiz i Issledovanie Operatsii, 2015, Vol. 22, No. 5, pp. 71–83.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Rychkov, K.L. Sufficient conditions for the local repetition-freeness of minimal π-schemes realizing linear Boolean functions. J. Appl. Ind. Math. 9, 580–587 (2015). https://doi.org/10.1134/S1990478915040146

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation