On the Number of Solutions to a System of Boolean Equations

We consider questions concerning the solvability and the number of solutions of systems of Boolean equations. Many mathematical models arising in both operations research and cryptography are described in the language of such systems. This is due, in particular, to the fact that, in general, the pro...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Automation and remote control Ročník 82; číslo 9; s. 1581 - 1596
Hlavní autori: Leontiev, V. K., Gordeev, E. N.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Moscow Pleiades Publishing 01.09.2021
Springer Nature B.V
Predmet:
Boolean
Boolean algebra
CAE) and Design
Calculus of Variations and Optimal Control; Optimization
Computer-Aided Engineering (CAD
Control
Cryptography
Enumeration
Mathematics
Mathematics and Statistics
Mechanical Engineering
Mechatronics
Operations Research
Optimization
Robotics
System Analysis
Systems Theory
Boolean programming problem
continuous linear form
linear transformation
Boolean equations
NP-completeness
ISSN:0005-1179, 1608-3032
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract We consider questions concerning the solvability and the number of solutions of systems of Boolean equations. Many mathematical models arising in both operations research and cryptography are described in the language of such systems. This is due, in particular, to the fact that, in general, the problem of checking the compatibility of such systems of equations is NP-complete; therefore, the study of the qualitative properties of a system of Boolean equations provides additional information that permits one either to single out polynomially solvable particular cases or to increase the efficiency of enumeration schemes. The focus is on two aspects. The first one concerns the study of the existence and number of solutions of a Boolean equation and a system of equations when parametrizing the problem by the right-hand sides. Formulas and estimates are given for calculating this number both in general and in particular cases. Its maximum is also investigated depending on the specified parameter. The second aspect is devoted to a special case of the problem when the equation is given by the so-called continuous linear form. The properties of such forms and various criteria of continuity are studied.
AbstractList We consider questions concerning the solvability and the number of solutions of systems of Boolean equations. Many mathematical models arising in both operations research and cryptography are described in the language of such systems. This is due, in particular, to the fact that, in general, the problem of checking the compatibility of such systems of equations is NP-complete; therefore, the study of the qualitative properties of a system of Boolean equations provides additional information that permits one either to single out polynomially solvable particular cases or to increase the efficiency of enumeration schemes. The focus is on two aspects. The first one concerns the study of the existence and number of solutions of a Boolean equation and a system of equations when parametrizing the problem by the right-hand sides. Formulas and estimates are given for calculating this number both in general and in particular cases. Its maximum is also investigated depending on the specified parameter. The second aspect is devoted to a special case of the problem when the equation is given by the so-called continuous linear form. The properties of such forms and various criteria of continuity are studied.
Author Gordeev, E. N.
Leontiev, V. K.
Author_xml – sequence: 1
  givenname: V. K.
  surname: Leontiev
  fullname: Leontiev, V. K.
  email: vkleontiev@yandex.ru
  organization: Dorodnicyn Computing Centre, Russian Academy of Sciences
– sequence: 2
  givenname: E. N.
  surname: Gordeev
  fullname: Gordeev, E. N.
  email: werhorn@yandex.ru
  organization: Bauman Moscow State Technical University
BookMark eNp9kEFLAzEQhYNUsK3-AG8Bz6uTZJNN8KSlVaHYQxW8Lck2q1u2mzbJHvrv3W0FQdHTwLz3zTzeCA0a11iELglcE8LSmyUAcEIyRQkoAPF2goZEgEwYMDpAw15Oev0MjUJYAxAClA3R7aLB8cPi53ZjrMeuxEtXt7FyTcDRYY2X-xDtphfunautbvB01-qD4RydlroO9uJrjtHrbPoyeUzmi4enyd08KRgRMbE8S42RalWuTEEFVaoQmRJcmm6faqWN1lQwzsssI4wyalOrhEwlECvMyrIxujre3Xq3a22I-dq1vule5pQrzhWkUnau7OgqvAvB2zIvqngIGr2u6pxA3jeV_2qqI8kPcuurjfb7fxl6ZELnbd6t_870N_QJmK95dQ
CitedBy_id crossref_primary_10_1134_S0361768824020142
crossref_primary_10_18255_1818_1015_2025_2_100_109
Cites_doi 10.1134/S0965542513050084
10.21681/2311-3456-2019-1-59-68
10.1007/978-3-540-24777-7
10.7868/S0044466915110113
10.1023/B:AURC.0000014716.77510.61
10.1134/S1064562418050198
10.21681/2311-3456-2017-3-63-69
10.1134/S0965542519080074
ContentType Journal Article
Copyright Pleiades Publishing, Ltd. 2021
Pleiades Publishing, Ltd. 2021.
Copyright_xml – notice: Pleiades Publishing, Ltd. 2021
– notice: Pleiades Publishing, Ltd. 2021.
DBID AAYXX
CITATION
JQ2
DOI 10.1134/S000511792109006X
DatabaseName CrossRef
ProQuest Computer Science Collection
DatabaseTitle CrossRef
ProQuest Computer Science Collection
DatabaseTitleList
ProQuest Computer Science Collection
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Mathematics
EISSN 1608-3032
EndPage 1596
ExternalDocumentID 10_1134_S000511792109006X
GroupedDBID -5D
-5G
-BR
-EM
-Y2
-~C
-~X
.4S
.86
.DC
.VR
06D
0R~
0VY
1N0
23N
2J2
2JN
2JY
2KG
2KM
2LR
2P1
2VQ
2~H
30V
4.4
408
409
40D
40E
5GY
5VS
67Z
6NX
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
ABDBF
ABDZT
ABECU
ABEFU
ABFTD
ABFTV
ABHQN
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABSXP
ABTAH
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACHSB
ACHXU
ACIWK
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACSNA
ACUHS
ACZOJ
ADHHG
ADHIR
ADINQ
ADKNI
ADKPE
ADMLS
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEMSY
AENEX
AEOHA
AEPYU
AETLH
AEVLU
AEXYK
AFBBN
AFFNX
AFGCZ
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGJBK
AGMZJ
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHSBF
AHYZX
AI.
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJBLW
AJRNO
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARCSS
ARMRJ
ASPBG
AVWKF
AXYYD
AZFZN
B-.
B0M
BA0
BAPOH
BDATZ
BGNMA
BSONS
CAG
COF
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
EAD
EAP
EBLON
EBS
EDO
EIOEI
EJD
EMK
EPL
ESBYG
ESX
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNWQR
GQ6
GQ7
GQ8
GROUPED_DOAJ
GXS
H13
HF~
HG6
HLICF
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
H~9
I-F
IHE
IJ-
IKXTQ
IWAJR
IXC
IXD
IXE
IZIGR
IZQ
I~X
I~Z
J-C
JBSCW
JCJTX
JZLTJ
KDC
KOV
LAK
LLZTM
M4Y
MA-
MK~
N2Q
NB0
NPVJJ
NQJWS
NU0
O9-
O93
O9J
OAM
OVD
P2P
P9O
PF0
PT4
QOS
R89
R9I
RNI
RNS
ROL
RPX
RSV
RZC
RZE
S16
S1Z
S27
S3B
SAP
SDH
SHX
SISQX
SJYHP
SMT
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
TEORI
TN5
TSG
TSK
TSV
TUC
TUS
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
VH1
W23
W48
WH7
WK8
XU3
YLTOR
Z7R
Z7Z
Z83
Z88
ZMTXR
ZY4
~8M
~A9
AAPKM
AAYXX
ABDBE
ABFSG
ABJCF
ABRTQ
ACSTC
ADHKG
AEZWR
AFDZB
AFFHD
AFHIU
AFKRA
AFOHR
AGQPQ
AHPBZ
AHWEU
AIXLP
ARAPS
ATHPR
BENPR
BGLVJ
CCPQU
CITATION
HCIFZ
K7-
M7S
PHGZM
PHGZT
PQGLB
PTHSS
JQ2
ID FETCH-LOGICAL-c316t-e574bb89dfdbc26299c679658b74b4a9abaa26355f7713232e4e9684801e6bde3
IEDL.DBID RSV
ISICitedReferencesCount 3
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000716460600006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0005-1179
IngestDate Wed Sep 17 23:56:16 EDT 2025
Sat Nov 29 06:42:09 EST 2025
Tue Nov 18 22:23:44 EST 2025
Fri Feb 21 02:47:53 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 9
Keywords Boolean programming problem
continuous linear form
linear transformation
Boolean equations
NP-completeness
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c316t-e574bb89dfdbc26299c679658b74b4a9abaa26355f7713232e4e9684801e6bde3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
PQID 2595590488
PQPubID 2043520
PageCount 16
ParticipantIDs proquest_journals_2595590488
crossref_citationtrail_10_1134_S000511792109006X
crossref_primary_10_1134_S000511792109006X
springer_journals_10_1134_S000511792109006X
PublicationCentury 2000
PublicationDate 2021-09-01
PublicationDateYYYYMMDD 2021-09-01
PublicationDate_xml – month: 09
  year: 2021
  text: 2021-09-01
  day: 01
PublicationDecade 2020
PublicationPlace Moscow
PublicationPlace_xml – name: Moscow
– name: New York
PublicationTitle Automation and remote control
PublicationTitleAbbrev Autom Remote Control
PublicationYear 2021
Publisher Pleiades Publishing
Springer Nature B.V
Publisher_xml – name: Pleiades Publishing
– name: Springer Nature B.V
References KuzyurinN.N.FominS.A.Effektivnye algoritmy i slozhnost’ vychislenii (Efficient Algorithms and Computational Complexity)2007MoscowMosk. Fiz.-Tekh. Inst.
MazurovV.D.KhachaiM.Yu.Committees of systems of linear inequalitiesAutom. Remote Control2004652193203209341810.1023/B:AURC.0000014716.77510.611066.90053
BeresnevV.L.An efficient algorithm for solving the problem of minimizing polynomials in Boolean variables with the connectedness propertyDiskretn. Anal. Issled. Oper. Ser. 2200512131121681261249.90162
SchrijverA.Theory of Linear and Integer Programming1986ChichesterJohn Wiley & Sons0665.90063
KellererH.PferschyU.PisingerD.Knapsack Problems2004BerlinSpringer10.1007/978-3-540-24777-7
Leont’evV.K.TonoyanG.P.Approximate solutions of systems of Boolean equationsComput. Math. Math. Phys.19933391221122712400450817.65038
Leont’evV.K.TonoyanG.P.On systems of Boolean equationsComput. Math. Math. Phys.2013535632639325319610.1134/S0965542513050084
Leont’evV.K.On pseudo-Boolean polynomialsComput. Math. Math. Phys.2015551119261932342305510.7868/S00444669151101131366.90139
Gordeev, E.N., Leontiev, V.K., and Medvedev, N.V., On the properties of Boolean polynomials relevant for cryptosystems, Vopr. Kiberbezop., 2017, no. 3, pp. 63–69. https://doi.org/10.21681/2311-3456-2017-3-63-69
GordeevE.N.Leont’evV.K.On combinatorial properties of the knapsack problemComput. Math. Math. Phys.201959813801388401081810.1134/S09655425190800741425.90093
Leontiev, V.K. and Gordeev, E.N., On the algebraic immunity of coding systems, Vopr. Kiberbezop., 2019, no. 1, pp. 59–89. https://doi.org/10.21681/2311-3456-2019-1-59-68
LeontievV.K.Kombinatorika i informatsiya. Ch. 1. Kombinatornyi analiz (Combinatorics and Information. Part 1. Combinatorial Analysis)2015MoscowMosk. FIz.-Tekh. Inst.
PapadimitriouC.H.SteiglitzK.Combinatorial Optimization: Algorithms and Complexity1982Englewood Cliffs, N.J.Prentice-Hall0503.90060
LeontievV.K.GordeevE.N.Generating functions in the knapsack problemDokl. Math.20189836436610.1134/S10645624180501981402.90152
GareyM.JohnsonD.Computers and Intractability1979San Francisco W. H. Freeman0411.68039
LeontievV.K.Kombinatorika i informatsiya. Ch. 2. Informatsionnye modeli (Combinatorics and Information. Part 2. Information Models)2015MoscowMosk. Fiz.-Tekh. Inst.
2176_CR10
E.N. Gordeev (2176_CR5) 2019; 59
V.K. Leont’ev (2176_CR8) 2013; 53
C.H. Papadimitriou (2176_CR1) 1982
N.N. Kuzyurin (2176_CR9) 2007
M. Garey (2176_CR2) 1979
V.K. Leontiev (2176_CR4) 2018; 98
V.L. Beresnev (2176_CR13) 2005; 12
V.K. Leont’ev (2176_CR7) 1993; 33
V.K. Leontiev (2176_CR15) 2015
H. Kellerer (2176_CR6) 2004
A. Schrijver (2176_CR3) 1986
V.D. Mazurov (2176_CR12) 2004; 65
V.K. Leontiev (2176_CR16) 2015
V.K. Leont’ev (2176_CR14) 2015; 55
2176_CR11
References_xml – reference: PapadimitriouC.H.SteiglitzK.Combinatorial Optimization: Algorithms and Complexity1982Englewood Cliffs, N.J.Prentice-Hall0503.90060
– reference: Gordeev, E.N., Leontiev, V.K., and Medvedev, N.V., On the properties of Boolean polynomials relevant for cryptosystems, Vopr. Kiberbezop., 2017, no. 3, pp. 63–69. https://doi.org/10.21681/2311-3456-2017-3-63-69
– reference: LeontievV.K.GordeevE.N.Generating functions in the knapsack problemDokl. Math.20189836436610.1134/S10645624180501981402.90152
– reference: GordeevE.N.Leont’evV.K.On combinatorial properties of the knapsack problemComput. Math. Math. Phys.201959813801388401081810.1134/S09655425190800741425.90093
– reference: Leont’evV.K.TonoyanG.P.On systems of Boolean equationsComput. Math. Math. Phys.2013535632639325319610.1134/S0965542513050084
– reference: Leontiev, V.K. and Gordeev, E.N., On the algebraic immunity of coding systems, Vopr. Kiberbezop., 2019, no. 1, pp. 59–89. https://doi.org/10.21681/2311-3456-2019-1-59-68
– reference: LeontievV.K.Kombinatorika i informatsiya. Ch. 2. Informatsionnye modeli (Combinatorics and Information. Part 2. Information Models)2015MoscowMosk. Fiz.-Tekh. Inst.
– reference: BeresnevV.L.An efficient algorithm for solving the problem of minimizing polynomials in Boolean variables with the connectedness propertyDiskretn. Anal. Issled. Oper. Ser. 2200512131121681261249.90162
– reference: LeontievV.K.Kombinatorika i informatsiya. Ch. 1. Kombinatornyi analiz (Combinatorics and Information. Part 1. Combinatorial Analysis)2015MoscowMosk. FIz.-Tekh. Inst.
– reference: Leont’evV.K.On pseudo-Boolean polynomialsComput. Math. Math. Phys.2015551119261932342305510.7868/S00444669151101131366.90139
– reference: Leont’evV.K.TonoyanG.P.Approximate solutions of systems of Boolean equationsComput. Math. Math. Phys.19933391221122712400450817.65038
– reference: MazurovV.D.KhachaiM.Yu.Committees of systems of linear inequalitiesAutom. Remote Control2004652193203209341810.1023/B:AURC.0000014716.77510.611066.90053
– reference: GareyM.JohnsonD.Computers and Intractability1979San Francisco W. H. Freeman0411.68039
– reference: KellererH.PferschyU.PisingerD.Knapsack Problems2004BerlinSpringer10.1007/978-3-540-24777-7
– reference: KuzyurinN.N.FominS.A.Effektivnye algoritmy i slozhnost’ vychislenii (Efficient Algorithms and Computational Complexity)2007MoscowMosk. Fiz.-Tekh. Inst.
– reference: SchrijverA.Theory of Linear and Integer Programming1986ChichesterJohn Wiley & Sons0665.90063
– volume: 12
  start-page: 3
  issue: 1
  year: 2005
  ident: 2176_CR13
  publication-title: Diskretn. Anal. Issled. Oper. Ser. 2
– volume: 53
  start-page: 632
  issue: 5
  year: 2013
  ident: 2176_CR8
  publication-title: Comput. Math. Math. Phys.
  doi: 10.1134/S0965542513050084
– volume: 33
  start-page: 1221
  issue: 9
  year: 1993
  ident: 2176_CR7
  publication-title: Comput. Math. Math. Phys.
– volume-title: Kombinatorika i informatsiya. Ch. 2. Informatsionnye modeli (Combinatorics and Information. Part 2. Information Models)
  year: 2015
  ident: 2176_CR16
– ident: 2176_CR10
  doi: 10.21681/2311-3456-2019-1-59-68
– volume-title: Kombinatorika i informatsiya. Ch. 1. Kombinatornyi analiz (Combinatorics and Information. Part 1. Combinatorial Analysis)
  year: 2015
  ident: 2176_CR15
– volume-title: Combinatorial Optimization: Algorithms and Complexity
  year: 1982
  ident: 2176_CR1
– volume-title: Knapsack Problems
  year: 2004
  ident: 2176_CR6
  doi: 10.1007/978-3-540-24777-7
– volume-title: Theory of Linear and Integer Programming
  year: 1986
  ident: 2176_CR3
– volume: 55
  start-page: 1926
  issue: 11
  year: 2015
  ident: 2176_CR14
  publication-title: Comput. Math. Math. Phys.
  doi: 10.7868/S0044466915110113
– volume: 65
  start-page: 193
  issue: 2
  year: 2004
  ident: 2176_CR12
  publication-title: Autom. Remote Control
  doi: 10.1023/B:AURC.0000014716.77510.61
– volume: 98
  start-page: 364
  year: 2018
  ident: 2176_CR4
  publication-title: Dokl. Math.
  doi: 10.1134/S1064562418050198
– ident: 2176_CR11
  doi: 10.21681/2311-3456-2017-3-63-69
– volume-title: Computers and Intractability
  year: 1979
  ident: 2176_CR2
– volume-title: Effektivnye algoritmy i slozhnost’ vychislenii (Efficient Algorithms and Computational Complexity)
  year: 2007
  ident: 2176_CR9
– volume: 59
  start-page: 1380
  issue: 8
  year: 2019
  ident: 2176_CR5
  publication-title: Comput. Math. Math. Phys.
  doi: 10.1134/S0965542519080074
SSID ssj0011023
Score 2.239581
Snippet We consider questions concerning the solvability and the number of solutions of systems of Boolean equations. Many mathematical models arising in both...
SourceID proquest
crossref
springer
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 1581
SubjectTerms Boolean
Boolean algebra
CAE) and Design
Calculus of Variations and Optimal Control; Optimization
Computer-Aided Engineering (CAD
Control
Cryptography
Enumeration
Mathematics
Mathematics and Statistics
Mechanical Engineering
Mechatronics
Operations Research
Optimization
Robotics
System Analysis
Systems Theory
Title On the Number of Solutions to a System of Boolean Equations
URI https://link.springer.com/article/10.1134/S000511792109006X
https://www.proquest.com/docview/2595590488
Volume 82
WOSCitedRecordID wos000716460600006&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: PRVAVX
  databaseName: SpringerLINK Contemporary 1997-Present
  customDbUrl:
  eissn: 1608-3032
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0011023
  issn: 0005-1179
  databaseCode: RSV
  dateStart: 20010101
  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/eLvHCXMwnV1LT4QwEJ7o6kEPvo3oanrwpCGBUgrEk5rdeHE1vrI3UmibmGxAF_T3O-W1vhM9lg4N6Qzz6Ey_ATj0qHRZqoUdeC61GUcfLkmQIS6qSeqEEaeKVc0mgtEoHI-j6-Yed9FWu7cpyUpT131HmLnTiwKE8kNNLaHDx_OwgNYuNP0abm4futSBwSKofV7fNuRNKvPbJT4ao5mH-SkpWtma4eq_vnINVhrXkpzWsrAOcyrbgOV3gIM4uuxQWotNOLnKCA7JqOoKQnJNukMyUuZEkBrO3Eyc5flEiYwMnmto8GIL7oeDu_MLu2mmYKeey0tb-QFDLkRSyySlHK1Qao6Q_DDB50xEIhHCANP4OsC4Ff0sxVTEQ4Muo3gilbcNvSzP1A6QxHekkF6gqKRMaCF0oH2TkcTQTzOpLXDaXY3TBmncNLyYxFXE4bH4yy5ZcNS98lTDbPxG3G9ZFTd_XBFjGIfBkdFHFhy3rJlN_7jY7p-o92CJmqKWqsisD71y-qL2YTF9LR-L6UEliG_Wl9I_
linkProvider Springer Nature
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8QwEB50FdSDb3F11Rw8KYU2TV94UtlFcbeKrrK3krYJCEur2-rvd9LX-gY9ppmGkpnOIzP5BuDQpLHBIsk1xzSoxmz04cIQGWKgmqS669lUsKLZhOP77mjk3VT3uLO62r1OSRaauuw7wtSdXhQglB-qagl1ezQLcwwNlgLMv717aFIHCoug9HktTZFXqcxvl_hojKYe5qekaGFreiv_-spVWK5cS3JaysIazIhkHZbeAQ7iaNCgtGYbcHKdEBwSv-gKQlJJmkMykqeEkxLOXE2cpelY8IR0n0to8GwT7nvd4fmFVjVT0CLTsHNNWA5DLnixjMOI2miFInWEZLkhPmfc4yHnCpjGkg7GrehnCSY821XoMsIOY2FuQStJE7ENJLT0mMemI2hMGZecS0daKiOJoZ9ksWyDXu9qEFVI46rhxTgoIg6TBV92qQ1HzStPJczGb8SdmlVB9cdlAYZxGBwpfdSG45o10-kfF9v5E_UBLFwMB_2gf-lf7cIiVQUuRcFZB1r55EXswXz0mj9mk_1CKN8AuqzVIw
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8QwEB50FdGDb3F11Rw8KcU2TV948rGLotYFH-ytpE0CwtKu2-rvN2nTrm8Qj2mmoWSmyUxm8n0A-zZmFkkENTzbwgZxpQ8Xx1IhllwmsekHLuakJJvwwtAfDIK-5jnN62r3OiVZ3WlQKE1pcTRiQnOQEHW_VxqTtCWs6gpNdzANM0TV0atw_e6xSSMoXILK_3UMJa7Tmt8O8XFjmnibnxKk5b7TW_r3Fy_DonY50UllIyswxdNVWHgHRChbNw16a74Gx7cpkk0UlmwhKBOoOTxDRYYoqmDOVcdplg05TVH3uYIMz9fhode9P7swNMmCkdiWWxjc8YjUTsAEixPsyt0pUUdLjh_L54QGNKZUAdY4wpPxrPS_OOGB6yvUGe7GjNsb0EqzlG8Cih2TUWZ7HDNMqKBUeMJRmUoZEgrCRBvMeoajRCOQKyKMYVRGIjaJvsxSGw6aV0YV_MZvwp1abZH-E_NIhncyaFLrVBsOazVNun8cbOtP0nsw1z_vRdeX4dU2zGNV91LWoXWgVYxf-A7MJq_FUz7eLe3zDW2D3gc
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+Number+of+Solutions+to+a+System+of+Boolean+Equations&rft.jtitle=Automation+and+remote+control&rft.au=Leontiev%2C+V.+K.&rft.au=Gordeev%2C+E.+N.&rft.date=2021-09-01&rft.pub=Pleiades+Publishing&rft.issn=0005-1179&rft.eissn=1608-3032&rft.volume=82&rft.issue=9&rft.spage=1581&rft.epage=1596&rft_id=info:doi/10.1134%2FS000511792109006X&rft.externalDocID=10_1134_S000511792109006X
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0005-1179&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0005-1179&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0005-1179&client=summon