Skip to main content
SpringerLink
Log in

Recognizing the nonrepeating property in an arbitrary basis

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

Abstract

Two classical problems are considered: recognizing the properties of a Boolean function given a column of its values and constructing a diagnostic test. The problems are investigated for nonrepeating functions in an arbitrary basis B. For the first problem, the decomposition method is applied to prove linear complexity of the corresponding sequential circuits; for the second problem we derive the order of the Shannon functions for a number of bases, in particular, for the basis of all functions of four 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.

Similar content being viewed by others

References

  1. A. A. Voronenko, “The decomposition method for recognizing membership in invariant classes,” Diskretnaya Matematika, 14, No. 4, 110–116 (2002).

    MathSciNet  Google Scholar 

  2. V. B. Alekseev, Lectures in Discrete Mathematics [in Russian], MAKS Press, Moscow (2004).

    Google Scholar 

  3. J. E. Savage, The Complexity of Computing [Russian translation], Izd. “Faktorial,” Moscow (1998).

    Google Scholar 

  4. G. P. Gavrilov and A. A. Sapozhenko, Collection of Problems in Discrete Mathematics [in Russian], Nauka, Moscow (1992).

    Google Scholar 

  5. A. A. Voronenko, “On diagnostic tests for nonrepeating functions,” Matem. Voprosy Kibern., 11, 163–176 (2002).

    Google Scholar 

  6. S. V. Vinokurov and N. A. Peryazev (eds.), Issues in the Theory of Boolean Functions [in Russian], Fizmatlit, Moscow (2001).

    Google Scholar 

  7. A. A. Voronenko, Testing on Some Sets of Nonrepeating Functions [in Russian], MAKS Press, Moscow (2005).

    Google Scholar 

  8. A. A. Voronenko, “On the length of a diagnostic test for nonrepeating functions in the basis {0, 1, &, ∨, ¬},” Diskretnaya Matematika, 17, No. 2, 139–143 (2005).

    MathSciNet  Google Scholar 

  9. A. A. Voronenko, “Estimating the length of a diagnostic test for some nonrepeating functions,” Prikladnaya Matematika i Informatika, MAKS Press, Moscow, 15, 85–97 (2003).

    Google Scholar 

Download references

Authors
  1. A. A. Voronenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

__________

Translated from Prikladnaya Matematika i Informatika, No. 23, pp. 67–84, 2006.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Voronenko, A.A. Recognizing the nonrepeating property in an arbitrary basis. Comput Math Model 18, 55–65 (2007). https://doi.org/10.1007/s10598-007-0006-z

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10598-007-0006-z

Keywords

Search

Navigation