Skip to main content
SpringerLink
Log in

Recognition of Functions Invariant Under Moebius Transformation and Even Functions Defined in Polynomial Form

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

The article considers polynomial specification of Boolean functions. Efficient algorithms are proposed for recognition of Moebius-invariant functions and even functions. A relationship is established between polynomials of even functions and polynomials of Moebius-invariant functions.

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. N. Selezneva, “Complexity of deciding completeness of a set of Boolean functions realized by Zhegalkin polynomials,” Diskr. Matem., 4, No. 9, 34–41 (1997).

    Google Scholar 

  2. S. N. Gorshkov, “Complexity of deciding multi-affinity, bijunctivity, weak positivity, and weak negativity of a Boolean function,” Obozrenie Prikl. Promyshl. Matem., ser. Diskr. Matem., 4, No. 2, 216–237 (1997).

    Google Scholar 

  3. S. V. Yablonskii, Introduction to Discrete Mathematics [in Russian], Nauka, Moscow (1986).

    Google Scholar 

  4. J. Pieprzyk and X.-M. Zhang, “Computing Mobius transforms of Boolean functions and characterising coincident Boolean functions,” in: Rouen: Publications des Universites de Rouen et du Havre, Rouen, France (2007), pp. 135–151.

  5. A. Aho, J. Hopcroft, and J. Ullman, The Design and Analysis of Computer Algorithms [Russian translation], Mir, Moscow (1979).

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    A. V. Bukhman

Authors
  1. A. V. Bukhman
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. V. Bukhman.

Additional information

Translated from Prikladnaya Matematika i Informatika, No. 41, 2012, pp. 105–112.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bukhman, A.V. Recognition of Functions Invariant Under Moebius Transformation and Even Functions Defined in Polynomial Form. Comput Math Model 24, 552–557 (2013). https://doi.org/10.1007/s10598-013-9198-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10598-013-9198-6

Keywords

Search

Navigation