The multiplicative complexity of 6-variable Boolean functions
Sign Up to like & getrecommendations! Published in 2018 at "Cryptography and Communications"
DOI: 10.1007/s12095-018-0297-2
Abstract: 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… read more here.
Keywords: functions multiplicative; complexity; boolean functions; multiplicative complexity ... See more keywords
Multiplicative Complexity of XOR Based Regular Functions
Sign Up to like & getrecommendations! Published in 2022 at "IEEE Transactions on Computers"
DOI: 10.1109/tc.2022.3141249
Abstract: XOR-AND Graphs (XAGs) are an enrichment of the classical AND-Inverter Graphs (AIGs) with XOR nodes. In particular, XAGs are networks composed by ANDs, XORs, and inverters. Besides several emerging technologies applications, XAGs are often exploited… read more here.
Keywords: number gates; complexity xor; complexity; multiplicative complexity ... See more keywords