Asymptotics for the Complexity of Boolean Functions with Small Number of Ones

The class of Boolean functions consisting of all functions of variables each of which outputs at exactly -tuples of values of the variables is considered. For small , for example, for , an asymptotics for the complexity of implementation of every function in by a circuit of functional elements in an...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Mathematical Notes Ročník 109; číslo 1-2; s. 256 - 261
Hlavný autor: Red’kin, N. P.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Moscow Pleiades Publishing 01.01.2021
Springer Nature B.V
Predmet:
14/34
639/766/189
639/766/530
639/766/747
Asymptotic properties
Boolean
Boolean algebra
Boolean functions
Circuits
Complexity
Mathematical analysis
Mathematics
Mathematics and Statistics
complexity of a function
Boolean function
circuit
ISSN:0001-4346, 1067-9073, 1573-8876
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract The class of Boolean functions consisting of all functions of variables each of which outputs at exactly -tuples of values of the variables is considered. For small , for example, for , an asymptotics for the complexity of implementation of every function in by a circuit of functional elements in an irredundant basis containing and is found.
AbstractList The class of Boolean functions consisting of all functions of variables each of which outputs at exactly -tuples of values of the variables is considered. For small , for example, for , an asymptotics for the complexity of implementation of every function in by a circuit of functional elements in an irredundant basis containing and is found.
The class of Boolean functions consisting of all functions of variables each of which outputs at exactly -tuples of values of the variables is considered. For small , for example, for , an asymptotics for the complexity of implementation of every function in by a circuit of functional elements in an irredundant basis containing and is found.
Author Red’kin, N. P.
Author_xml – sequence: 1
  givenname: N. P.
  surname: Red’kin
  fullname: Red’kin, N. P.
  email: npredkin@mail.ru
  organization: Lomonosov Moscow State University
BookMark eNp1kMFOwzAQRC1UJNrCB3CzxDngdRwnOZaKAhLQQ-Ecue6apkrsYjuC_j2JisQBcVrtzptZaSZkZJ1FQi6BXQOk4mbFGAORCsmBAeOlPCFjyPI0KYpcjsh4kJNBPyOTEHb9BhLYmDzPwqHdRxdrHahxnsYt0rlr9w1-1fFAnaG3zjWoLF10Vsfa2UA_67ilq1Y1DX3p2jX6AVtaDOfk1Kgm4MXPnJK3xd3r_CF5Wt4_zmdPiYayiIlMtQQELQwattkoLsVasawsMVeiSGVqYK0zhRsFwJH1d8ZUzrUSaBA5plNydczde_fRYYjVznXe9i8rnomiTFkmi56CI6W9C8Gjqfa-bpU_VMCqobXqT2u9hx89oWftO_rf5P9N3wdYcDA
Cites_doi 10.1002/j.1538-7305.1949.tb03624.x
10.1515/1569392043272511
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
DOI 10.1134/S0001434621010296
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList

DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISSN 1573-8876
EndPage 261
ExternalDocumentID 10_1134_S0001434621010296
GroupedDBID -EM
-~C
-~X
.86
.VR
06D
0R~
1SB
2J2
2JN
2JY
2KG
2KM
2LR
30V
4.4
408
409
40D
40E
5QI
5VS
642
67Z
6NX
8UJ
95-
95.
95~
96X
AABHQ
ABTAH
ACIWK
AEFIE
AEGNC
AEXYK
AFFNX
AHYZX
AIIXL
AJRNO
ALMA_UNASSIGNED_HOLDINGS
ALWAN
ARMRJ
ASPBG
AVWKF
AZFZN
B-.
B0M
BA0
CAG
COF
DL5
EAD
EAP
EBS
EJD
EMK
EPL
ESBYG
ESX
FNLPD
FWDCC
GGRSB
GJIRD
GQ6
GQ8
GXS
HG6
HMJXF
HQYDN
HRMNR
HZ~
H~9
IHE
IXC
IXD
IXE
IZIGR
I~X
I~Z
JBSCW
JCJTX
KOV
KOW
LAK
MA-
N2Q
NB0
NU0
O9-
O93
O9G
O9I
O9J
OVD
P19
P9R
PF0
PT5
QOK
QOS
RHV
RNI
RPX
RSV
RZC
RZE
RZK
S16
S3B
SAP
SDD
SDH
SHX
SMT
SNE
SNX
SOJ
TN5
TSG
TSK
TSV
TUC
TUS
U2A
UG4
VC2
W23
WK8
XU3
ZY4
~A9
~EX
AAYXX
ABFSG
ACSTC
AEZWR
AFHIU
AHWEU
AIXLP
CITATION
ID FETCH-LOGICAL-c198t-63c61e1c4fef0dda264ba0599e7a48363f1bc5aeda112e099e00a72ca4efee2e3
IEDL.DBID RSV
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000670512900029&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0001-4346
1067-9073
IngestDate Thu Sep 25 00:41:19 EDT 2025
Sat Nov 29 03:48:54 EST 2025
Fri Feb 21 02:48:30 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 1-2
Keywords complexity of a function
Boolean function
circuit
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c198t-63c61e1c4fef0dda264ba0599e7a48363f1bc5aeda112e099e00a72ca4efee2e3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
PQID 2548930568
PQPubID 2043561
PageCount 6
ParticipantIDs proquest_journals_2548930568
crossref_primary_10_1134_S0001434621010296
springer_journals_10_1134_S0001434621010296
PublicationCentury 2000
PublicationDate 20210100
2021-01-00
20210101
PublicationDateYYYYMMDD 2021-01-01
PublicationDate_xml – month: 1
  year: 2021
  text: 20210100
PublicationDecade 2020
PublicationPlace Moscow
PublicationPlace_xml – name: Moscow
– name: New York
PublicationTitle Mathematical Notes
PublicationTitleAbbrev Math Notes
PublicationYear 2021
Publisher Pleiades Publishing
Springer Nature B.V
Publisher_xml – name: Pleiades Publishing
– name: Springer Nature B.V
References Red’kin (CR7) 2019; 0
Red’kin (CR4) 2004; 14
Shannon (CR1) 0000; 28
Finikov (CR3) 1957; 115
CR6
CR5
Lupanov (CR2) 1984
O. B. Lupanov (2134_CR2) 1984
2134_CR6
C. E. Shannon (2134_CR1) 0000; 28
N. P. Red’kin (2134_CR4) 2004; 14
B. I. Finikov (2134_CR3) 1957; 115
2134_CR5
N. P. Red’kin (2134_CR7) 2019; 0
References_xml – volume: 28
  start-page: 59
  year: 0000
  end-page: 98
  ident: CR1
  article-title: The synthesis of two-terminal switching circuits
  publication-title: Bell System Tech. J.
  doi: 10.1002/j.1538-7305.1949.tb03624.x
– volume: 0
  start-page: 23
  year: 2019
  end-page: 26
  ident: CR7
  article-title: On the complexity of realization of Boolean functions with a small number of ones
  publication-title: Materials of the XIII International Seminar “Discrete Mathematics and Its Applications”
– ident: CR6
– year: 1984
  ident: CR2
  publication-title: Asymptotic Estimates of the Complexity of Controlling Systems
– ident: CR5
– volume: 115
  start-page: 247
  issue: 2
  year: 1957
  end-page: 248
  ident: CR3
  article-title: On a family of classes of functions in the logic algebra and their realization in the class of -schemes
  publication-title: Dokl. Akad. Nauk SSSR
– volume: 14
  start-page: 619
  issue: 6
  year: 2004
  end-page: 630
  ident: CR4
  article-title: On the complexity of Boolean functions with a small number of ones
  publication-title: Discrete Math. Appl.
  doi: 10.1515/1569392043272511
– ident: 2134_CR6
– ident: 2134_CR5
– volume: 0
  start-page: 23
  year: 2019
  ident: 2134_CR7
  publication-title: Materials of the XIII International Seminar “Discrete Mathematics and Its Applications”
– volume: 115
  start-page: 247
  issue: 2
  year: 1957
  ident: 2134_CR3
  publication-title: Dokl. Akad. Nauk SSSR
– volume: 28
  start-page: 59
  year: 0000
  ident: 2134_CR1
  publication-title: Bell System Tech. J.
  doi: 10.1002/j.1538-7305.1949.tb03624.x
– volume-title: Asymptotic Estimates of the Complexity of Controlling Systems
  year: 1984
  ident: 2134_CR2
– volume: 14
  start-page: 619
  issue: 6
  year: 2004
  ident: 2134_CR4
  publication-title: Discrete Math. Appl.
  doi: 10.1515/1569392043272511
SSID ssj0011610
ssj0039783
Score 2.1816564
Snippet The class of Boolean functions consisting of all functions of variables each of which outputs at exactly -tuples of values of the variables is considered. For...
The class of Boolean functions consisting of all functions of variables each of which outputs at exactly -tuples of values of the variables is considered. For...
SourceID proquest
crossref
springer
SourceType Aggregation Database
Index Database
Publisher
StartPage 256
SubjectTerms 14/34
639/766/189
639/766/530
639/766/747
Asymptotic properties
Boolean
Boolean algebra
Boolean functions
Circuits
Complexity
Mathematical analysis
Mathematics
Mathematics and Statistics
Title Asymptotics for the Complexity of Boolean Functions with Small Number of Ones
URI https://link.springer.com/article/10.1134/S0001434621010296
https://www.proquest.com/docview/2548930568
Volume 109
WOSCitedRecordID wos000670512900029&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: 1573-8876
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0039783
  issn: 0001-4346
  databaseCode: RSV
  dateStart: 19970101
  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/eLvHCXMwnV1LT8MwDLZgcIADb8RgoBw4gSo1ffc4EBMHNpAGaLcqpI6EtLXTWpD273HSdhOvAxyjpFbluvbnOPkMcC6kQorjvr6iHFOCIoUlfCUsP454GCr-EkjTteQuHAyi0Sh-qO9xF81p96YkaTx11XfE03d6NRedF1CSQlExDlZhzddkMzpFHz4vSgfcAIJq4OqNjQoAU6ZEz9Z1zR_lfY5MS7j5pUJqAk9v-1-vvANbNc5k3cowdmEFsz3Y7C9IWot96HeL-WRa5nrECLsymmPaP2iOzHLOcsWu8nyMImM9in7GQJnet2XDiRiP2cA0E9HL7slfHsBT7-bx-taquytYksdRaQWuDDhy6SlUdpoKQkYvQrO1YCi8yA1c-lDSF5gKgmRIQBJtW4SOFB4qRAfdQ2hleYZHwCIpuXKV5sbnXuo7IrKVLq8SFAkwTaM2XDSaTaYViUZikg_XS77pqA2dRvdJ_T8VCaWxBKwIrJGsy0bXy-lfhR3_afUJbDj6yIrZYelAq5y94Smsy_fytZidGTP7ABOiyIo
linkProvider Springer Nature
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dS8NADA86BfXBb3E69R58Ugq7fvdximPiVoVN2Vu5Xe9A2NqxVmH_vblru-HXgz4edw0lTZNfkksCcMm4FGjHHVWiHKCDwpnBHMkMJ_Cp50k6crmeWtL1wtAfDoOnso47q267VylJramLuSO2qulVvehsF50UtIqBuwprtpqyo1z0_ssidUA1ICgWlgpsFAAYPSV8tsxr_kjvs2Vaws0vGVJteNo7_3rlXdgucSZpFYKxBysi2Yet3qJJa3YAvVY2n0zzVK0IYleCe0TpB9UjM5-TVJKbNB0LlpA2Wj8toETFbUl_wsZjEuphIurYI-rLQ3hu3w1uO0Y5XcHgNPBzw7W4SwXlthSyGccMkdGIqW4twmO2b7kWfijuMBEzhGQCgaRoNplncmYLKYQprCOoJWkijoH4nFNpSdUbn9qxYzK_KVV6FaGIK-LYr8NVxdloWjTRiLTzYdnRNx7VoVHxPir_pyxCNxaBFYI1pHVd8Xq5_Suxkz-dvoCNzqDXjbr34cMpbJrq-oqOtjSgls_exBms8_f8NZuda5H7AIRYy24
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1bS8MwFA46RfTBuzidmgeflGKzprfHeSmKWx1OZW8lSxMQtnasVdi_9yRtN7w9iI8hF0qS5nzn9h2EThmXAuS4rVKUfVBQODOYLZlh-x5xXUkGDtdVS9puGHr9vt8t65xmVbR75ZIschoUS1OSX4xjWdYgoSq_V_HSUQcUFpCQvrOIligoMiqm67H3MnMjEA0OioaljBwFGAatCeaWPs4f1_sspebQ84u3VAuhYOPfn7-J1kv8iVvFhdlCCyLZRmudGXlrtoM6rWw6GuepamHAtBj6sHo3FHdmPsWpxJdpOhQswQFIRX1xsbLn4t6IDYc41EVG1LAHeEd30XNw83R1a5RVFwxOfC83HIs7RBBOpZBmHDNATAOmWFyEy6hnORYcILeZiBlANQEAU5gmc5ucUSGFaAprD9WSNBH7CHucE2lJxZlPaGw3mWdK5XYFiOKIOPbq6Kza5WhckGtEWimxaPRtj-qoUZ1DVP5nWQTqLQAuAHGw1nm17_PuXxc7-NPoE7TSvQ6i9l14f4hWmyqqRRthGqiWT97EEVrm7_lrNjnWt-8D_8vUUg
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=Asymptotics+for+the+Complexity+of+Boolean+Functions+with+Small+Number+of+Ones&rft.jtitle=Mathematical+Notes&rft.au=Red%E2%80%99kin%2C+N.+P.&rft.date=2021-01-01&rft.pub=Pleiades+Publishing&rft.issn=0001-4346&rft.eissn=1573-8876&rft.volume=109&rft.issue=1-2&rft.spage=256&rft.epage=261&rft_id=info:doi/10.1134%2FS0001434621010296&rft.externalDocID=10_1134_S0001434621010296
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0001-4346&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0001-4346&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0001-4346&client=summon