On the enumeration of Boolean functions with distinguished variables

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Soft computing (Berlin, Germany) Jg. 25; H. 19; S. 12627 - 12640
1. Verfasser: Freixas, Josep
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.10.2021
Schlagworte:
ISSN:1432-7643, 1433-7479
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
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.
AbstractList 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.
Author Freixas, Josep
Author_xml – sequence: 1
  givenname: Josep
  orcidid: 0000-0002-9033-9432
  surname: Freixas
  fullname: Freixas, Josep
  email: josep.freixas@upc.edu
  organization: Universitat Politècnica de Catalunya
BookMark eNp9kM1OwzAMgCM0JLbBC3DKCwSSOMHdEcavNGkXOEdpmq6ZuhQlLYi3p9s4cdghcmz5s-xvRiaxi56Qa8FvBOd4mznXnDMux6eVlEyfkalQAAwVLiaHv2R4p-CCzHLeci4FapiSx3WkfeOpj8POJ9uHLtKupg9d13obaT1Et69l-h36hlYh9yFuhpAbX9Evm4ItW58vyXlt2-yv_uKcfDw_vS9f2Wr98ra8XzEHoHumS4WoBfrSOUA_ptIWWMoKQXGJqMAWFiosvCxhoUoohJVQy7LghXUoYU6K41yXupyTr40L_WHnPtnQGsHN3oY52jCjDXOwYfSIyn_oZwo7m35OQ3CE8tgcNz6ZbTekOJ54ivoFu4Zz9g
CitedBy_id crossref_primary_10_1080_02331934_2022_2154126
Cites_doi 10.1007/3-540-54945-5_54
10.1137/S0097539793269089
10.1007/s00500-019-03769-y
10.1016/j.dam.2021.03.011
10.1016/0012-365X(85)90080-9
10.1007/s11590-015-0917-0
10.1007/978-3-662-46950-7
10.1006/game.1993.1009
10.1016/j.mathsocsci.2012.11.007
10.1002/9781118314593
10.1007/BF00125203
10.1007/0-387-34799-2_30
10.1016/S0167-5060(08)70731-3
10.1016/0165-4896(85)90032-0
10.1016/j.mathsocsci.2011.11.004
10.1090/S0002-9939-1992-1092927-0
10.1023/A:1016324824094
10.1023/A:1016368606348
10.1007/s11238-017-9606-z
10.1016/0166-218X(87)90056-4
10.1016/j.ejor.2012.10.017
10.1215/S0012-7094-58-02537-7
10.1007/s10479-011-0863-x
10.1007/s00182-012-0327-9
10.1007/978-0-387-77645-3
10.1016/0165-4896(96)00815-3
10.1017/S0008423900028560
10.1007/978-94-009-2099-6
10.1016/S0377-2217(02)00903-7
10.1016/j.dam.2008.09.009
10.1007/978-1-4615-2696-4
10.1007/s00145-006-0334-8
10.1016/j.ejor.2014.01.020
10.4337/9781840647761
10.1525/9780520329560
10.1007/s10479-012-1108-3
ContentType Journal Article
Copyright Springer-Verlag GmbH Germany, part of Springer Nature 2020
Copyright_xml – notice: Springer-Verlag GmbH Germany, part of Springer Nature 2020
DBID AAYXX
CITATION
DOI 10.1007/s00500-020-05422-5
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EISSN 1433-7479
EndPage 12640
ExternalDocumentID 10_1007_s00500_020_05422_5
GrantInformation_xml – fundername: Ministerio de Ciencia, Innovación y Universidades (ES)
  grantid: PID2019-I04987GB-I00
GroupedDBID -5B
-5G
-BR
-EM
-Y2
-~C
.86
.VR
06D
0R~
0VY
1N0
1SB
203
29~
2J2
2JN
2JY
2KG
2LR
2P1
2VQ
2~H
30V
4.4
406
408
409
40D
40E
5VS
67Z
6NX
8TC
8UJ
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYTO
AAYZH
ABAKF
ABBBX
ABBXA
ABDZT
ABECU
ABFTD
ABFTV
ABHLI
ABHQN
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACHSB
ACHXU
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACSNA
ACZOJ
ADHHG
ADHIR
ADINQ
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AFBBN
AFGCZ
AFKRA
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGGDS
AGJBK
AGMZJ
AGQEE
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHSBF
AHYZX
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJBLW
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARAPS
ARMRJ
ASPBG
AVWKF
AXYYD
AYJHY
AZFZN
B-.
BA0
BDATZ
BENPR
BGLVJ
BGNMA
BSONS
CAG
CCPQU
COF
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
DU5
EBLON
EBS
EIOEI
EJD
ESBYG
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNWQR
GQ6
GQ7
GQ8
GXS
H13
HCIFZ
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
I09
IHE
IJ-
IKXTQ
IWAJR
IXC
IXD
IXE
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
K7-
KDC
KOV
LAS
LLZTM
M4Y
MA-
N2Q
NB0
NPVJJ
NQJWS
NU0
O9-
O93
O9J
OAM
P2P
P9P
PF0
PT4
PT5
QOS
R89
R9I
RIG
RNI
ROL
RPX
RSV
RZK
S16
S1Z
S27
S3B
SAP
SDH
SEG
SHX
SISQX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
TSG
TSK
TSV
TUC
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
W23
W48
WK8
YLTOR
Z45
Z5O
Z7R
Z7X
Z7Y
Z7Z
Z81
Z83
Z88
ZMTXR
AAPKM
AAYXX
ABBRH
ABDBE
ABFSG
ABRTQ
ACSTC
ADHKG
ADKFA
AEZWR
AFDZB
AFFHD
AFHIU
AFOHR
AGQPQ
AHPBZ
AHWEU
AIXLP
ATHPR
AYFIA
CITATION
PHGZM
PHGZT
PQGLB
ID FETCH-LOGICAL-c335t-5b477517ebcc37e5b42a87b2d734027743a8a3d78e2b394b381a23f2b808ac723
IEDL.DBID RSV
ISICitedReferencesCount 2
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000590510400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1432-7643
IngestDate Tue Nov 18 22:41:04 EST 2025
Sat Nov 29 03:36:06 EST 2025
Fri Feb 21 02:47:48 EST 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 19
Keywords Complete games
Boolean functions
Enumeration of Boolean functions
Dedekind’s problem
2-Monotonic Boolean functions
Simple games
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c335t-5b477517ebcc37e5b42a87b2d734027743a8a3d78e2b394b381a23f2b808ac723
ORCID 0000-0002-9033-9432
OpenAccessLink http://hdl.handle.net/2117/341224
PageCount 14
ParticipantIDs crossref_citationtrail_10_1007_s00500_020_05422_5
crossref_primary_10_1007_s00500_020_05422_5
springer_journals_10_1007_s00500_020_05422_5
PublicationCentury 2000
PublicationDate 20211000
2021-10-00
PublicationDateYYYYMMDD 2021-10-01
PublicationDate_xml – month: 10
  year: 2021
  text: 20211000
PublicationDecade 2020
PublicationPlace Berlin/Heidelberg
PublicationPlace_xml – name: Berlin/Heidelberg
PublicationSubtitle A Fusion of Foundations, Methodologies and Applications
PublicationTitle Soft computing (Berlin, Germany)
PublicationTitleAbbrev Soft Comput
PublicationYear 2021
Publisher Springer Berlin Heidelberg
Publisher_xml – name: Springer Berlin Heidelberg
References FreixasJMolineroXRouraSComplete voting systems with two types of voters: weightedness and countingAnn Oper Res2012193273287287476610.1007/s10479-011-0863-x
TaylorADPacelliAMathematics and politics20082New YorkSpringer10.1007/978-0-387-77645-3
CheungWSNgTWA three-dimensional voting system in Hong KongEur J Oper Res2014236292297317312210.1016/j.ejor.2014.01.020
KilgourMA formal analysis of the amending formula of Canada’s Constitution ActCan J Polit Sci19831677177710.1017/S0008423900028560
HardyGHRamanujan: twelve lectures on subjects suggested by his life and work19993New YorkChelsea0027.19608
HuSTThreshold logic1965BerkeleyUniversity of California Press10.1525/9780520329560
IsbellJRA class of simple gamesDuke Mat J1958254234399702810.1215/S0012-7094-58-02537-7
SiuKRoychowdhuryVKailathTDiscrete neural computation: a theoretical foundation1995Englewood CliffsPrentice-Hall0838.68034
Freixas J, Samaniego D (2020) On the enumeration of bipartite simple games. Discrete Appl Math (submitted)
MurogaSThreshold logic and its applications1971NewYorkWiley0243.94014
von NeumannJMorgensternOTheory of games and economic behavior1944PrincetonPrinceton University Press0063.05930
PictonPDNeural networks19912IndianapolisMacmillan
KurzSNapelSA dimension of the Lisbon voting rules in the EU Council: a challenge and new world recordOptim Lett201610612451256352984410.1007/s11590-015-0917-0
TaylorADZwickerWSWeighted voting, multicameral representation, and powerGames Econ Behav19935170181120147910.1006/game.1993.1009
TaylorADZwickerWSSimple games: desirability relations, trading, and pseudoweightings1999PrincetonPrinceton University Press0943.91005
CarrerasFFreixasJComplete simple gamesMath Soc Sci199632139155140885810.1016/0165-4896(96)00815-3
TaylorADZwickerWSA characterization of weighted votingProc Am Math Soc199211510891094109292710.1090/S0002-9939-1992-1092927-0
FreixasJThe dimension for the European Union Council under the Nice rulesEur J Oper Res200415641541910.1016/S0377-2217(02)00903-7
KurzSTautenhahnNOn Dedekind’s problem for complete simple gamesInt J Game Theory201342411437305390210.1007/s00182-012-0327-9
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
FreixasJPuenteMAReliability importance measures of the components in a system based on semivalues and probabilistic valuesAnn Oper Res2002109331342192973810.1023/A:1016368606348
KuoWZhuXImportance measures is reliability, risk, and optimization: principles and applications2012West SussexWiley10.1002/9781118314593
PetersHGame theory: a multi-leveled approach20152AmsterdamSpringer10.1007/978-3-662-46950-7
StinsonDRAn explication of secret sharing schemesDes Codes Crypt19922357390119477610.1007/BF00125203
FreixasJKurzSThe golden number and Fibonacci sequences in the design of voting systemsEur J Oper Res201322624625710.1016/j.ejor.2012.10.017
GvozdevaTHameedASlinkoAWeightedness and structural characterization of hierarchical simple gamesMath Soc Sci201365181189302919510.1016/j.mathsocsci.2012.11.007
Le BretonMMonteroMZaporozhetsVVoting power in the EU council of ministers and fair decision making in distributive politicsMath Soc Sci201263159173288897310.1016/j.mathsocsci.2011.11.004
EinyEThe desirability relation of simple gamesMath Soc Sci19851015516880604010.1016/0165-4896(85)90032-0
Sloane NJA (1964) www.oeis.org. Encyclopedia On-Line of Integer Sequences
KurzSOn minimum sum representations for weighted voting gamesAnn Oper Res20121961361369294658410.1007/s10479-012-1108-3
BorosEHammerPLIbarakiTKawakawiKPolynomial time recognition of 2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2$$\end{document}-monotonic positive functions given by an oracleSIAM J Comput19972693109143124710.1137/S0097539793269089
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
ChvátalVHammerPLAggregation of inequalities in integer programmingAnn Discrete Math1977114516247938410.1016/S0167-5060(08)70731-3
MarziFRossiFSmriglioSComputational study of separation algorithms for clique inequalitiesSoft Comput2019233013302710.1007/s00500-019-03769-y
FelsenthalDSMachoverMThe measurement of voting power1998CheltenhamEdward Elgar Publishing Limited10.4337/9781840647761
RoychowdhuryVSiuKOrlitskyATheoretical advances in neural computation and learning1994NorwellKluwer10.1007/978-1-4615-2696-4
LeechDVoting power in the governance of the International Monetary FundAnn Oper Res2002109375397192974110.1023/A:1016324824094
CramaYDualization of regular Boolean functionsDiscrete Appl Math198716798586974010.1016/0166-218X(87)90056-4
FreixasJFreixasMKurzSOn the characterization of weighted simple gamesTheor Decis2017834469498373632710.1007/s11238-017-9606-z
TassaTHierarchical threshold secret sharingJ Cryptol200720237264234412110.1007/s00145-006-0334-8
FreixasJMolineroXSimple games and weighted games: a theoretical and computational viewpointDiscrete Appl Math200915714961508251023010.1016/j.dam.2008.09.009
RamamurthyKGCoherent structures and simple games, theory and decision series C1990AmsterdamSpringer10.1007/978-94-009-2099-6
ReitermanJRödlVŠiňajováETumaMThreshold hypergraphsDiscrete Math19855419320079166010.1016/0012-365X(85)90080-9
WS Cheung (5422_CR4) 2014; 236
J Freixas (5422_CR10) 2013; 226
GH Hardy (5422_CR17) 1999
V Chvátal (5422_CR5) 1977; 1
E Boros (5422_CR2) 1997; 26
T Tassa (5422_CR38) 2007; 20
S Kurz (5422_CR22) 2012; 196
ST Hu (5422_CR18) 1965
J Reiterman (5422_CR32) 1985; 54
E Einy (5422_CR7) 1985; 10
Y Crama (5422_CR6) 1987; 16
S Kurz (5422_CR24) 2013; 42
AD Taylor (5422_CR41) 1993; 5
M Kilgour (5422_CR20) 1983; 16
J Freixas (5422_CR12) 2002; 109
D Leech (5422_CR26) 2002; 109
5422_CR1
W Kuo (5422_CR21) 2012
M Le Breton (5422_CR25) 2012; 63
J Freixas (5422_CR14) 2012; 193
KG Ramamurthy (5422_CR31) 1990
AD Taylor (5422_CR42) 1999
AD Taylor (5422_CR39) 2008
DS Felsenthal (5422_CR8) 1998
J Freixas (5422_CR11) 2009; 157
T Gvozdeva (5422_CR16) 2013; 65
F Marzi (5422_CR27) 2019; 23
J Freixas (5422_CR15) 2017; 83
JR Isbell (5422_CR19) 1958; 25
S Muroga (5422_CR28) 1971
K Siu (5422_CR35) 1995
AD Taylor (5422_CR40) 1992; 115
S Kurz (5422_CR23) 2016; 10
V Roychowdhury (5422_CR33) 1994
F Carreras (5422_CR3) 1996; 32
5422_CR34
5422_CR13
DR Stinson (5422_CR37) 1992; 2
H Peters (5422_CR29) 2015
5422_CR36
J von Neumann (5422_CR43) 1944
J Freixas (5422_CR9) 2004; 156
PD Picton (5422_CR30) 1991
References_xml – reference: RoychowdhuryVSiuKOrlitskyATheoretical advances in neural computation and learning1994NorwellKluwer10.1007/978-1-4615-2696-4
– reference: TassaTHierarchical threshold secret sharingJ Cryptol200720237264234412110.1007/s00145-006-0334-8
– reference: FreixasJPuenteMAReliability importance measures of the components in a system based on semivalues and probabilistic valuesAnn Oper Res2002109331342192973810.1023/A:1016368606348
– reference: TaylorADPacelliAMathematics and politics20082New YorkSpringer10.1007/978-0-387-77645-3
– reference: FelsenthalDSMachoverMThe measurement of voting power1998CheltenhamEdward Elgar Publishing Limited10.4337/9781840647761
– reference: 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
– reference: IsbellJRA class of simple gamesDuke Mat J1958254234399702810.1215/S0012-7094-58-02537-7
– reference: StinsonDRAn explication of secret sharing schemesDes Codes Crypt19922357390119477610.1007/BF00125203
– reference: KuoWZhuXImportance measures is reliability, risk, and optimization: principles and applications2012West SussexWiley10.1002/9781118314593
– reference: ChvátalVHammerPLAggregation of inequalities in integer programmingAnn Discrete Math1977114516247938410.1016/S0167-5060(08)70731-3
– reference: EinyEThe desirability relation of simple gamesMath Soc Sci19851015516880604010.1016/0165-4896(85)90032-0
– reference: ReitermanJRödlVŠiňajováETumaMThreshold hypergraphsDiscrete Math19855419320079166010.1016/0012-365X(85)90080-9
– reference: KilgourMA formal analysis of the amending formula of Canada’s Constitution ActCan J Polit Sci19831677177710.1017/S0008423900028560
– reference: KurzSTautenhahnNOn Dedekind’s problem for complete simple gamesInt J Game Theory201342411437305390210.1007/s00182-012-0327-9
– reference: CarrerasFFreixasJComplete simple gamesMath Soc Sci199632139155140885810.1016/0165-4896(96)00815-3
– reference: RamamurthyKGCoherent structures and simple games, theory and decision series C1990AmsterdamSpringer10.1007/978-94-009-2099-6
– reference: CramaYDualization of regular Boolean functionsDiscrete Appl Math198716798586974010.1016/0166-218X(87)90056-4
– reference: HuSTThreshold logic1965BerkeleyUniversity of California Press10.1525/9780520329560
– reference: HardyGHRamanujan: twelve lectures on subjects suggested by his life and work19993New YorkChelsea0027.19608
– reference: LeechDVoting power in the governance of the International Monetary FundAnn Oper Res2002109375397192974110.1023/A:1016324824094
– reference: CheungWSNgTWA three-dimensional voting system in Hong KongEur J Oper Res2014236292297317312210.1016/j.ejor.2014.01.020
– reference: Freixas J, Samaniego D (2020) On the enumeration of bipartite simple games. Discrete Appl Math (submitted)
– reference: von NeumannJMorgensternOTheory of games and economic behavior1944PrincetonPrinceton University Press0063.05930
– reference: Le BretonMMonteroMZaporozhetsVVoting power in the EU council of ministers and fair decision making in distributive politicsMath Soc Sci201263159173288897310.1016/j.mathsocsci.2011.11.004
– reference: TaylorADZwickerWSWeighted voting, multicameral representation, and powerGames Econ Behav19935170181120147910.1006/game.1993.1009
– reference: MurogaSThreshold logic and its applications1971NewYorkWiley0243.94014
– reference: FreixasJMolineroXSimple games and weighted games: a theoretical and computational viewpointDiscrete Appl Math200915714961508251023010.1016/j.dam.2008.09.009
– reference: MarziFRossiFSmriglioSComputational study of separation algorithms for clique inequalitiesSoft Comput2019233013302710.1007/s00500-019-03769-y
– reference: TaylorADZwickerWSSimple games: desirability relations, trading, and pseudoweightings1999PrincetonPrinceton University Press0943.91005
– reference: PetersHGame theory: a multi-leveled approach20152AmsterdamSpringer10.1007/978-3-662-46950-7
– reference: SiuKRoychowdhuryVKailathTDiscrete neural computation: a theoretical foundation1995Englewood CliffsPrentice-Hall0838.68034
– reference: FreixasJThe dimension for the European Union Council under the Nice rulesEur J Oper Res200415641541910.1016/S0377-2217(02)00903-7
– reference: 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
– reference: TaylorADZwickerWSA characterization of weighted votingProc Am Math Soc199211510891094109292710.1090/S0002-9939-1992-1092927-0
– reference: GvozdevaTHameedASlinkoAWeightedness and structural characterization of hierarchical simple gamesMath Soc Sci201365181189302919510.1016/j.mathsocsci.2012.11.007
– reference: PictonPDNeural networks19912IndianapolisMacmillan
– reference: BorosEHammerPLIbarakiTKawakawiKPolynomial time recognition of 2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2$$\end{document}-monotonic positive functions given by an oracleSIAM J Comput19972693109143124710.1137/S0097539793269089
– reference: FreixasJKurzSThe golden number and Fibonacci sequences in the design of voting systemsEur J Oper Res201322624625710.1016/j.ejor.2012.10.017
– reference: FreixasJMolineroXRouraSComplete voting systems with two types of voters: weightedness and countingAnn Oper Res2012193273287287476610.1007/s10479-011-0863-x
– reference: FreixasJFreixasMKurzSOn the characterization of weighted simple gamesTheor Decis2017834469498373632710.1007/s11238-017-9606-z
– reference: KurzSNapelSA dimension of the Lisbon voting rules in the EU Council: a challenge and new world recordOptim Lett201610612451256352984410.1007/s11590-015-0917-0
– reference: KurzSOn minimum sum representations for weighted voting gamesAnn Oper Res20121961361369294658410.1007/s10479-012-1108-3
– reference: Sloane NJA (1964) www.oeis.org. Encyclopedia On-Line of Integer Sequences
– ident: 5422_CR1
  doi: 10.1007/3-540-54945-5_54
– volume: 26
  start-page: 93
  year: 1997
  ident: 5422_CR2
  publication-title: SIAM J Comput
  doi: 10.1137/S0097539793269089
– volume: 23
  start-page: 3013
  year: 2019
  ident: 5422_CR27
  publication-title: Soft Comput
  doi: 10.1007/s00500-019-03769-y
– ident: 5422_CR13
  doi: 10.1016/j.dam.2021.03.011
– volume: 54
  start-page: 193
  year: 1985
  ident: 5422_CR32
  publication-title: Discrete Math
  doi: 10.1016/0012-365X(85)90080-9
– volume: 10
  start-page: 1245
  issue: 6
  year: 2016
  ident: 5422_CR23
  publication-title: Optim Lett
  doi: 10.1007/s11590-015-0917-0
– volume-title: Game theory: a multi-leveled approach
  year: 2015
  ident: 5422_CR29
  doi: 10.1007/978-3-662-46950-7
– volume: 5
  start-page: 170
  year: 1993
  ident: 5422_CR41
  publication-title: Games Econ Behav
  doi: 10.1006/game.1993.1009
– volume: 65
  start-page: 181
  year: 2013
  ident: 5422_CR16
  publication-title: Math Soc Sci
  doi: 10.1016/j.mathsocsci.2012.11.007
– volume-title: Importance measures is reliability, risk, and optimization: principles and applications
  year: 2012
  ident: 5422_CR21
  doi: 10.1002/9781118314593
– volume-title: Simple games: desirability relations, trading, and pseudoweightings
  year: 1999
  ident: 5422_CR42
– volume-title: Ramanujan: twelve lectures on subjects suggested by his life and work
  year: 1999
  ident: 5422_CR17
– volume: 2
  start-page: 357
  year: 1992
  ident: 5422_CR37
  publication-title: Des Codes Crypt
  doi: 10.1007/BF00125203
– ident: 5422_CR34
  doi: 10.1007/0-387-34799-2_30
– volume: 1
  start-page: 145
  year: 1977
  ident: 5422_CR5
  publication-title: Ann Discrete Math
  doi: 10.1016/S0167-5060(08)70731-3
– volume-title: Discrete neural computation: a theoretical foundation
  year: 1995
  ident: 5422_CR35
– ident: 5422_CR36
– volume: 10
  start-page: 155
  year: 1985
  ident: 5422_CR7
  publication-title: Math Soc Sci
  doi: 10.1016/0165-4896(85)90032-0
– volume: 63
  start-page: 159
  year: 2012
  ident: 5422_CR25
  publication-title: Math Soc Sci
  doi: 10.1016/j.mathsocsci.2011.11.004
– volume: 115
  start-page: 1089
  year: 1992
  ident: 5422_CR40
  publication-title: Proc Am Math Soc
  doi: 10.1090/S0002-9939-1992-1092927-0
– volume-title: Theory of games and economic behavior
  year: 1944
  ident: 5422_CR43
– volume: 109
  start-page: 375
  year: 2002
  ident: 5422_CR26
  publication-title: Ann Oper Res
  doi: 10.1023/A:1016324824094
– volume: 109
  start-page: 331
  year: 2002
  ident: 5422_CR12
  publication-title: Ann Oper Res
  doi: 10.1023/A:1016368606348
– volume: 83
  start-page: 469
  issue: 4
  year: 2017
  ident: 5422_CR15
  publication-title: Theor Decis
  doi: 10.1007/s11238-017-9606-z
– volume: 16
  start-page: 79
  year: 1987
  ident: 5422_CR6
  publication-title: Discrete Appl Math
  doi: 10.1016/0166-218X(87)90056-4
– volume: 226
  start-page: 246
  year: 2013
  ident: 5422_CR10
  publication-title: Eur J Oper Res
  doi: 10.1016/j.ejor.2012.10.017
– volume: 25
  start-page: 423
  year: 1958
  ident: 5422_CR19
  publication-title: Duke Mat J
  doi: 10.1215/S0012-7094-58-02537-7
– volume: 193
  start-page: 273
  year: 2012
  ident: 5422_CR14
  publication-title: Ann Oper Res
  doi: 10.1007/s10479-011-0863-x
– volume: 42
  start-page: 411
  year: 2013
  ident: 5422_CR24
  publication-title: Int J Game Theory
  doi: 10.1007/s00182-012-0327-9
– volume-title: Mathematics and politics
  year: 2008
  ident: 5422_CR39
  doi: 10.1007/978-0-387-77645-3
– volume: 32
  start-page: 139
  year: 1996
  ident: 5422_CR3
  publication-title: Math Soc Sci
  doi: 10.1016/0165-4896(96)00815-3
– volume: 16
  start-page: 771
  year: 1983
  ident: 5422_CR20
  publication-title: Can J Polit Sci
  doi: 10.1017/S0008423900028560
– volume-title: Coherent structures and simple games, theory and decision series C
  year: 1990
  ident: 5422_CR31
  doi: 10.1007/978-94-009-2099-6
– volume: 156
  start-page: 415
  year: 2004
  ident: 5422_CR9
  publication-title: Eur J Oper Res
  doi: 10.1016/S0377-2217(02)00903-7
– volume: 157
  start-page: 1496
  year: 2009
  ident: 5422_CR11
  publication-title: Discrete Appl Math
  doi: 10.1016/j.dam.2008.09.009
– volume-title: Neural networks
  year: 1991
  ident: 5422_CR30
– volume-title: Theoretical advances in neural computation and learning
  year: 1994
  ident: 5422_CR33
  doi: 10.1007/978-1-4615-2696-4
– volume: 20
  start-page: 237
  year: 2007
  ident: 5422_CR38
  publication-title: J Cryptol
  doi: 10.1007/s00145-006-0334-8
– volume-title: Threshold logic and its applications
  year: 1971
  ident: 5422_CR28
– volume: 236
  start-page: 292
  year: 2014
  ident: 5422_CR4
  publication-title: Eur J Oper Res
  doi: 10.1016/j.ejor.2014.01.020
– volume-title: The measurement of voting power
  year: 1998
  ident: 5422_CR8
  doi: 10.4337/9781840647761
– volume-title: Threshold logic
  year: 1965
  ident: 5422_CR18
  doi: 10.1525/9780520329560
– volume: 196
  start-page: 361
  issue: 1
  year: 2012
  ident: 5422_CR22
  publication-title: Ann Oper Res
  doi: 10.1007/s10479-012-1108-3
SSID ssj0021753
Score 2.2953181
Snippet Boolean functions have a fundamental role in neural networks and machine learning. Enumerating these functions and significant subclasses is a highly complex...
SourceID crossref
springer
SourceType Enrichment Source
Index Database
Publisher
StartPage 12627
SubjectTerms Artificial Intelligence
Computational Intelligence
Control
Engineering
Focus
Mathematical Logic and Foundations
Mechatronics
Robotics
Title On the enumeration of Boolean functions with distinguished variables
URI https://link.springer.com/article/10.1007/s00500-020-05422-5
Volume 25
WOSCitedRecordID wos000590510400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 1433-7479
  dateEnd: 20241209
  omitProxy: false
  ssIdentifier: ssj0021753
  issn: 1432-7643
  databaseCode: P5Z
  dateStart: 20090101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1433-7479
  dateEnd: 20241209
  omitProxy: false
  ssIdentifier: ssj0021753
  issn: 1432-7643
  databaseCode: K7-
  dateStart: 20090101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1433-7479
  dateEnd: 20241209
  omitProxy: false
  ssIdentifier: ssj0021753
  issn: 1432-7643
  databaseCode: BENPR
  dateStart: 20090101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVAVX
  databaseName: Springer LINK
  customDbUrl:
  eissn: 1433-7479
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0021753
  issn: 1432-7643
  databaseCode: RSV
  dateStart: 19970401
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3fS8MwED5080EfnE7F-WPkwTcNrE27pI9ON3yQOaaOvZUkTUUYrazb_n6TLC0OZKCPhWsp17vcd7277wBuJCcs1UAVR0JGOEi4xELjZuyxKORd7X3KklVPnulwyKbTaOSGwoqy270sSdqTuhp2M1QlHWzSHQ0zTAq1C3Ud7phZ2DB-nVRpluOe1EBAY0cdcN2ozO_P2AxHm7VQG2IGjf-93BEcOkiJ7tc2cAw7KmtCo1zXgJz3NuHgB_fgCTy-ZEiDP2Ra4dXaDFCeol6ezxTPkIl31iSR-VOLEnMUZB9L00GfoJVOsM3IVXEK74P-28MTdisVsCQkXOBQBJSGHlVCSkKVvvQ5o8JPKAlMNTcgnHGSUKZ8QaJA6HjOfZL6gnUYl9QnZ1DL8kydA0o9lXZ515NRRwWUEy4M8YtHwlQRFQRRC7xSs7F0fONm7cUsrpiSrdJirbTYKi0OW3Bb3fO1ZtvYKn1XfozYeV6xRfzib-KXsO-b_hXbuHcFtcV8qa5hT64Wn8W8DfVefzgat63pfQMHws9Q
linkProvider Springer Nature
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dS8MwED90CuqD06k4P_PgmwbWJl3SR7_GxDlF59hbSdJUhNHKuu3vN8na4UAG-li4lnK9y_2ud_c7gAslCE8MUMWhVCGmsVBYGtyMPR4Gomm8Tzuy6n6Hdbt8MAhfiqGwvOx2L0uS7qSeD7tZqpIGtumOgRk2hVqFNWoilmXMf33rz9OsgnvSAAGDHU3ALUZlfn_GYjharIW6ENOq_u_ldmC7gJToemYDu7Ci0xpUy3UNqPDeGmz94B7cg7vnFBnwh2wrvJ6ZAcoSdJNlQy1SZOOdM0lk_9Si2B4F6cfEdtDHaGoSbDtyle_De-u-d9vGxUoFrAgJxjiQlLHAY1oqRZg2l77gTPoxI9RWcykRXJCYce1LElJp4rnwSeJL3uBCMZ8cQCXNUn0IKPF00hRNT4UNTZkgQlriF48EiSaa0rAOXqnZSBV843btxTCaMyU7pUVGaZFTWhTU4XJ-z9eMbWOp9FX5MaLC8_Il4kd_Ez-HjXbvqRN1HrqPx7Dp214W18R3ApXxaKJPYV1Nx5_56MyZ3zdCMtCa
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3dS8MwED90iuiD06k4P_Pgm4atTbqkj-ocimMO1LG3kqSpCKMdW7e_36QfYwMZiI-FayjXu97vene_A7hRgvDIAFXsS-VjGgqFpcHN2OG-J1rG-3RGVj3osl6PD4d-f2mKP-t2L0uS-UyDZWmK08Y4jBqLwTdLW9LENvUxkMOmU5uwRW0jvc3X3weLlKvgoTSgwOBIE3yLsZnfz1gNTat10SzcdKr_f9AD2C-gJrrPbeMQNnRcg2q5xgEVXl2DvSVOwiNov8XIgEJkW-R1bh4oidBDkoy0iJGNg5mpIvsHF4X2ExF_zWxnfYjmJvG2o1jTY_jsPH08PuNi1QJWhHgp9iRlzHOYlkoRps2lKziTbsgItVVeSgQXJGRcu5L4VJo4L1wSuZI3uVDMJSdQiZNYnwKKHB21RMtRflNTJoiQlhDGIV6kiabUr4NTajlQBQ-5XYcxChYMypnSAqO0IFNa4NXhdnHPOGfhWCt9V76YoPDI6Rrxs7-JX8NOv90Jui-913PYdW2LS9bbdwGVdDLTl7Ct5un3dHKVWeIPTWjZfg
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=On+the+enumeration+of+Boolean+functions+with+distinguished+variables&rft.jtitle=Soft+computing+%28Berlin%2C+Germany%29&rft.au=Freixas%2C+Josep&rft.date=2021-10-01&rft.issn=1432-7643&rft.eissn=1433-7479&rft.volume=25&rft.issue=19&rft.spage=12627&rft.epage=12640&rft_id=info:doi/10.1007%2Fs00500-020-05422-5&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s00500_020_05422_5
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1432-7643&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1432-7643&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1432-7643&client=summon