The multiplicative complexity of 6-variable Boolean functions

The multiplicative complexity of a Boolean function is the minimum number of two-input AND gates that are necessary and sufficient to implement the function over the basis (AND, XOR, NOT). Finding the multiplicative complexity of a given function is computationally intractable, even for functions wi...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Cryptography and communications Ročník 11; číslo 1; s. 93 - 107
Hlavní autoři:	Çalık, Çağdaş, Sönmez Turan, Meltem, Peralta, René
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.01.2019 Springer Nature B.V
Témata:	Affine transformations Boolean algebra Boolean functions Boolean Functions and their Applications II Circuits Codes Coding and Information Theory Communications Engineering Complexity Computer Science Data Structures and Information Theory Equivalence Gates Information and Communication Mathematical analysis Mathematics of Computing Networks 06E30 Boolean functions Multiplicative complexity 94A60 Affine equivalence Cryptography Circuit complexity
ISSN:	1936-2447, 1936-2455
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!