Skip to main content
SpringerLink
Log in

Finding the Subsets of Variables of a Partial Boolean Function Which Are Sufficient for Its Implementation in the Classes Defined by Predicates

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

Abstract

Given a class K of partial Boolean functions and a partial Boolean function f of n variables, a subset U of its variables is called sufficient for the implementation of f in K if there exists an extension of f in K with arguments in U. We consider the problem of recognizing all subsets sufficient for the implementation of f in K. For some classes defined by relations, we propose the algorithms of solving this problem with complexity of O(2nn2) bit operations. In particular, we present some algorithms of this complexity for the class P*2 of all partial Boolean functions and the class M*2 of all monotone partial Boolean functions. The proposed algorithms use the Walsh-Hadamard and Möbius transforms.

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. O. I. Golubeva, “Construction of Permissible Functions and their Application for Fault Tolerance,” in Proceedings of International Siberian Conference on Control and Communications (SIBCON), (Tomsk, Russia, Apr. 18–20, 2019) (TUSUR, Tomsk, 2019), pp. 1–5.

    Google Scholar 

  2. A. A. Voronenko, “On a Decomposition Method for Recognizing Membership in Invariant Classes,” Diskret. Mat. 14 (4), 110–116 (2002)

    Article  MathSciNet  Google Scholar 

  3. A. A. Voronenko, Discrete Math. Appl. 12 (6), 607–614 (2002)].

    MathSciNet  Google Scholar 

  4. S. N. Selezneva, “Constructing Polynomials for Functions over Residue Rings Modulo a Composite Number in Linear Time,” in Lecture Notes in Computer Science, Vol. 7353: Computer Science—Theory and Applications (Springer, Heidelberg, 2012), pp. 303–312.

    Google Scholar 

  5. V. B. Alekseev and N. R. Emel’yanov, “A Method for Constructing Fast Algorithms in k-Valued Logic,” Mat. Zametki 38 (1), 148–156, 171 (1985)

    MathSciNet  Google Scholar 

  6. V. B. Alekseev and N. R. Emel’yanov, Math. Notes 38 (1), 595–600 (1985)].

    Article  Google Scholar 

  7. V. B. Alekseev, “Stepwise Bilinear Algorithms and Recognition of Completeness in k-Valued Logics,” Izv. Vyssh. Uchebn. Zaved. Mat. No. 7, 19–27 (1988)

  8. V. B. Alekseev, Soviet Math. (Izv. VUZ) 32 (7), 31–42 (1988)].

    MathSciNet  Google Scholar 

  9. V. B. Alekseev, “Logical Semirings and Their Use in Constructing Fast Algorithms,” Vestnik Moskov. Univ. Ser. I, Mat. Mekh. No. 1, 22–29, 78–79 (1997)

  10. V. B. Alekseev, Moscow Univ. Math. Bull. 52 (1), 22–28 (1997)].

    MathSciNet  Google Scholar 

  11. N. G. Parvatov, “Generating Sufficient Sets for Partial Boolean Functions,” Vestnik Tomsk. Gos. Univ., Appendex. No 23, 44–48 (2007).

  12. V. N. Sachkov, Combinatorial Methods of Discrete Mathematics (Nauka, Moscow, 1977) [in Russian].

    Google Scholar 

  13. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes (North-Holland, Amsterdam, 1977; Svyaz’, Moscow, 1979).

    MATH  Google Scholar 

  14. S. K. Rushforth, “Fast Fourier-Hadamard Decoding of Orthogonal Codes,” Inform. and Control 15 (1), 33–37 (1969).

    Article  Google Scholar 

  15. A. A. Malyutin, “Fast Correlation Decoding of Some Subsets of Words of the First-Order Reed-Muller Code,” Diskret. Mat. 2 (2), 155–158 (1990)

    MathSciNet  MATH  Google Scholar 

  16. A. A. Malyutin, Discrete Math. Appl. 2 (2), 155–158 (1992).

    Article  MathSciNet  Google Scholar 

  17. Yu. D. Karyakin, “Fast Correlation Decoding of Reed-Muller Codes,” Problemy Peredachi Informatsii 23 (2), 40–49 (1987).

    MathSciNet  MATH  Google Scholar 

  18. N. N. Tokareva, “Generalizations of Bent Functions: A Survey of Publications,” Diskretn. Anal. Issled. Oper. 17 (1), 34–64, 99 (2010)

    MathSciNet  MATH  Google Scholar 

  19. N. N. Tokareva, J. Appl. Indust. Math. 5 (1), 110–129 (2011)].

    Article  MathSciNet  Google Scholar 

  20. L. Weisner, “Abstract Theory of Inversion of Finite Series,” Trans. Amer. Math. Soc. 38, 474–484 (1935).

    Article  MathSciNet  Google Scholar 

  21. P. Hall, “The Eulerian Functions of a Group,” Quart. J. Math. 7, 134–151 (1936).

    Article  Google Scholar 

  22. G. C. Rota, “On the Foundations of Combinatorial Theory. I. Theory of Möbius Functions,” Z. Wahrscheinlichkeitstheorie und Verw. Gebiete. 2, 340–368 (1964).

    Article  MathSciNet  Google Scholar 

  23. R. P. Stanley, Enumerative Combinatorics, Vol. 1 (Cambridge University Press, Cambridge, 1997).

  24. N. G. Parvatov, “On Recognizing of Properties of Discrete Functions by Boolean Circuits,” Vestnik Tomsk. Gos Univ. Appendix 14, 233–236 (2005).

    Google Scholar 

  25. A. Schönhage and V. Straßen, “Schnelle Multiplikation großer Zahlen,” Computing 7, 281–292 (1971).

    Article  MathSciNet  Google Scholar 

  26. M. Fürer, “Faster Integer Multiplication,” In Proceedings of the Thirty-Ninth ACM Symposium on Theory of Computing, STOC 2007 (San Diego, CA, USA, June 11–13, 2007) (ACM Press., New York, NY, USA, 2007), pp. 57–66.

    Google Scholar 

  27. A. De, C. Saha, P. Kurur, and R. Saptharishi, “Fast Integer Multiplication Using Modular Arithmetic,” in Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC) (Victoria, Canada, May 17–20, 2008) (ACM, New York, NY, 2008), pp. 499–506

    Google Scholar 

  28. A. De, C. Saha, P. Kurur, and R. Saptharishi, SIAM J. Comput. 42 (2), 685–699 (2013)].

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Tomsk State University, pr. Lenina 36, Tomsk, 634050, Russia

    N. G. Parvatov

Authors
  1. N. G. Parvatov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to N. G. Parvatov.

Additional information

Russian Text © The Author(s), 2020, published in Diskretnyi Analiz i Issledovanie Operatsii, 2020, Vol. 27, No. 1, pp. 110–126.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Parvatov, N.G. Finding the Subsets of Variables of a Partial Boolean Function Which Are Sufficient for Its Implementation in the Classes Defined by Predicates. J. Appl. Ind. Math. 14, 186–195 (2020). https://doi.org/10.1134/S1990478920010172

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation