Skip to main content
SpringerLink
Log in

On the enumeration of Boolean functions with distinguished variables

  • Focus
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Boolean functions have a fundamental role in neural networks and machine learning. Enumerating these functions and significant subclasses is a highly complex problem. Therefore, it is of interest to study subclasses that escape this limitation and can be enumerated by means of sequences depending on the number of variables. In this article, we obtain seven new formulas corresponding to enumerations of some subclasses of Boolean functions. The versatility of these functions does the problem interesting to several different fields as game theory, hypergraphs, reliability, cryptography or logic gates.

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

  • Boros E, Hammer PL, Ibaraki T, Kawakawi K (1991) Identifying 2-monotonic positive Boolean functions in polynomial time. In: Hsu WL, Lee RCT (eds) ISA’91 algorithms, Springer Lecture Notes in Computer Sciences (LNCS), vol 557, pp 104–115

  • Boros E, Hammer PL, Ibaraki T, Kawakawi K (1997) Polynomial time recognition of \(2\)-monotonic positive functions given by an oracle. SIAM J Comput 26:93–109

    Article  MathSciNet  Google Scholar 

  • Carreras F, Freixas J (1996) Complete simple games. Math Soc Sci 32:139–155

    Article  MathSciNet  Google Scholar 

  • Cheung WS, Ng TW (2014) A three-dimensional voting system in Hong Kong. Eur J Oper Res 236:292–297

    Article  MathSciNet  Google Scholar 

  • Chvátal V, Hammer PL (1977) Aggregation of inequalities in integer programming. Ann Discrete Math 1:145–162

    Article  MathSciNet  Google Scholar 

  • Crama Y (1987) Dualization of regular Boolean functions. Discrete Appl Math 16:79–85

    Article  MathSciNet  Google Scholar 

  • Einy E (1985) The desirability relation of simple games. Math Soc Sci 10:155–168

    Article  MathSciNet  Google Scholar 

  • Felsenthal DS, Machover M (1998) The measurement of voting power. Edward Elgar Publishing Limited, Cheltenham

    Book  Google Scholar 

  • Freixas J (2004) The dimension for the European Union Council under the Nice rules. Eur J Oper Res 156:415–419

    Article  Google Scholar 

  • Freixas J, Kurz S (2013) The golden number and Fibonacci sequences in the design of voting systems. Eur J Oper Res 226:246–257

    Article  Google Scholar 

  • Freixas J, Molinero X (2009) Simple games and weighted games: a theoretical and computational viewpoint. Discrete Appl Math 157:1496–1508

    Article  MathSciNet  Google Scholar 

  • Freixas J, Puente MA (2002) Reliability importance measures of the components in a system based on semivalues and probabilistic values. Ann Oper Res 109:331–342

    Article  MathSciNet  Google Scholar 

  • Freixas J, Samaniego D (2020) On the enumeration of bipartite simple games. Discrete Appl Math (submitted)

  • Freixas J, Molinero X, Roura S (2012) Complete voting systems with two types of voters: weightedness and counting. Ann Oper Res 193:273–287

    Article  MathSciNet  Google Scholar 

  • Freixas J, Freixas M, Kurz S (2017) On the characterization of weighted simple games. Theor Decis 83(4):469–498

    Article  MathSciNet  Google Scholar 

  • Gvozdeva T, Hameed A, Slinko A (2013) Weightedness and structural characterization of hierarchical simple games. Math Soc Sci 65:181–189

    Article  MathSciNet  Google Scholar 

  • Hardy GH (1999) Ramanujan: twelve lectures on subjects suggested by his life and work, 3rd edn. Chelsea, New York

    MATH  Google Scholar 

  • Hu ST (1965) Threshold logic. University of California Press, Berkeley

    Book  Google Scholar 

  • Isbell JR (1958) A class of simple games. Duke Mat J 25:423–439

    Article  MathSciNet  Google Scholar 

  • Kilgour M (1983) A formal analysis of the amending formula of Canada’s Constitution Act. Can J Polit Sci 16:771–777

    Article  Google Scholar 

  • Kuo W, Zhu X (2012) Importance measures is reliability, risk, and optimization: principles and applications. Wiley, West Sussex

    Book  Google Scholar 

  • Kurz S (2012) On minimum sum representations for weighted voting games. Ann Oper Res 196(1):361–369

    Article  MathSciNet  Google Scholar 

  • Kurz S, Napel S (2016) A dimension of the Lisbon voting rules in the EU Council: a challenge and new world record. Optim Lett 10(6):1245–1256

    Article  MathSciNet  Google Scholar 

  • Kurz S, Tautenhahn N (2013) On Dedekind’s problem for complete simple games. Int J Game Theory 42:411–437

    Article  MathSciNet  Google Scholar 

  • Le Breton M, Montero M, Zaporozhets V (2012) Voting power in the EU council of ministers and fair decision making in distributive politics. Math Soc Sci 63:159–173

    Article  MathSciNet  Google Scholar 

  • Leech D (2002) Voting power in the governance of the International Monetary Fund. Ann Oper Res 109:375–397

    Article  MathSciNet  Google Scholar 

  • Marzi F, Rossi F, Smriglio S (2019) Computational study of separation algorithms for clique inequalities. Soft Comput 23:3013–3027

    Article  Google Scholar 

  • Muroga S (1971) Threshold logic and its applications. Wiley, NewYork

    MATH  Google Scholar 

  • Peters H (2015) Game theory: a multi-leveled approach, 2nd edn. Springer, Amsterdam

    Book  Google Scholar 

  • Picton PD (1991) Neural networks, 2nd edn. Macmillan, Indianapolis

    Google Scholar 

  • Ramamurthy KG (1990) Coherent structures and simple games, theory and decision series C. Springer, Amsterdam

    Book  Google Scholar 

  • Reiterman J, Rödl V, Šiňajová E, Tuma M (1985) Threshold hypergraphs. Discrete Math 54:193–200

    Article  MathSciNet  Google Scholar 

  • Roychowdhury V, Siu K, Orlitsky A (1994) Theoretical advances in neural computation and learning. Kluwer, Norwell

    Book  Google Scholar 

  • Simmons GJ (1990) How to (really) share a secret. In: Proceedings of the 8th annual international cryptology conference on advances in cryptology, pp 390–448. Springer, London, UK

  • Siu K, Roychowdhury V, Kailath T (1995) Discrete neural computation: a theoretical foundation. Prentice-Hall, Englewood Cliffs

    MATH  Google Scholar 

  • Sloane NJA (1964) www.oeis.org. Encyclopedia On-Line of Integer Sequences

  • Stinson DR (1992) An explication of secret sharing schemes. Des Codes Crypt 2:357–390

    Article  MathSciNet  Google Scholar 

  • Tassa T (2007) Hierarchical threshold secret sharing. J Cryptol 20:237–264

    Article  MathSciNet  Google Scholar 

  • Taylor AD, Pacelli A (2008) Mathematics and politics, 2nd edn. Springer, New York

    Book  Google Scholar 

  • Taylor AD, Zwicker WS (1992) A characterization of weighted voting. Proc Am Math Soc 115:1089–1094

    Article  MathSciNet  Google Scholar 

  • Taylor AD, Zwicker WS (1993) Weighted voting, multicameral representation, and power. Games Econ Behav 5:170–181

    Article  MathSciNet  Google Scholar 

  • Taylor AD, Zwicker WS (1999) Simple games: desirability relations, trading, and pseudoweightings. Princeton University Press, Princeton

    MATH  Google Scholar 

  • von Neumann J, Morgenstern O (1944) Theory of games and economic behavior. Princeton University Press, Princeton

    MATH  Google Scholar 

Download references

Acknowledgements

I am very grateful to three anonymous referees whose interesting comments allowed me to improve the paper.

Funding

This study was partially funded by funds from the Spanish Ministry of Science and Innovation Grant PID2019-I04987GB-I00.

Author information

Authors and Affiliations

  1. Universitat Politècnica de Catalunya, Av. Bases de Manresa, 61-73, 08242, Manresa, Spain

    Josep Freixas

Authors
  1. Josep Freixas
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Josep Freixas.

Ethics declarations

Conflict of interest

I declare that I has no conflict of interest.

Ethical approval (in case of humans or animals were involved)

This article does not contain any studies with human participants or animals performed by any of the authors.

Additional information

Communicated by Marcello Sanguineti.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Freixas, J. On the enumeration of Boolean functions with distinguished variables. Soft Comput 25, 12627–12640 (2021). https://doi.org/10.1007/s00500-020-05422-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-020-05422-5

Keywords

Search

Navigation