Skip to main content
SpringerLink
Log in

The Length of a Read-Many Certificate in the Basis of All Functions of l Variables

  • Published:
Computational Mathematics and Modeling Aims and scope Submit manuscript

The article proves the read-many property of Boolean functions in the basis of all functions of l variables. The length of the minimal read-many certificate in this basis is known to be upper bounded by a polynomial of degree l – 1 in the number of function variables. In this article, we prove that the upper bound on the length of the minimal read-many certificate for functions in this basis is a polynomial of degree not exceeding l.

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. N. A. Peryazev, “Weakly read-many Boolean functions in a binary basis,” in: Discrete Mathematics and Informatics [in Russian], No. 4, Irkutsk University (1998).

  2. A. V. Kuznetsov, “Read-once contact networks and read-once superpositions of Boolean functions,” Trudy MIAN SSSR, 51, 186–225 (1958).

    MATH  Google Scholar 

  3. A. A. Voronenko, “Recognizing the read-once property in an arbitrary basis,” Prikl. Mat. Inform., No. 23, 67–84 (2006).

  4. D. Chistikov, V. Fedorova, and A. Voronenko, “Certificates of non-membership for classes of read-once functions,” TUCS Lecture Notes, No. 17, 48–53 (2012).

  5. A. A. Voronenko, V. S. Fedorova, and D. V. Dhistikov, “Read-many property of Boolean functions in an element basis,” Izv. Vuzov, Matem., 55, No. 11, 11–61 (2011).

    Google Scholar 

  6. B. A. Subbotovskaya, “Comparison of bases for formula realizations of Boolean functions,” Dokl. Akad. Nauk SSSR, 149, No. 4, 784–787 (1963).

    MathSciNet  Google Scholar 

  7. V. A. Stetsenko, “On pre-bad bases in P2,” Matem. Voprosy Kibern., Fizmatlit, No. 4, 139–177 (1992).

  8. D. V. Chistikov, “Checking tests for read-once functions over arbitrary bases,” in: Computer Science–Theory and Applications, Springer, Berlin-Heidelberg (2012), pp. 52–63.

  9. O. B. Lupanov, “Complexity of realization of Boolean functions by formulas,” Probl. Kibern., 3, 61–80 (1960).

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computational Mathematics and Cybernetics, Moscow State University, Moscow, Russia

    A. A. Voronenko & D. V. Kaftan

Authors
  1. A. A. Voronenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. V. Kaftan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. A. Voronenko.

Additional information

Translated from Prikladnaya Matematika i Informatika, No. 44, pp. 95–102, 2013.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Voronenko, A.A., Kaftan, D.V. The Length of a Read-Many Certificate in the Basis of All Functions of l Variables. Comput Math Model 25, 576–582 (2014). https://doi.org/10.1007/s10598-014-9250-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10598-014-9250-1

Keywords

Search

Navigation