Caricamento...
Upper Bounds on the Multiplicative Complexity of Symmetric Boolean Functions
A special metric of interest about Boolean functions is multiplicative complexity (MC): the minimum number of AND gates sufficient to implement a function with a Boolean circuit over the basis {XOR, AND, NOT}. In this paper we study the MC of symmetric Boolean functions, whose output is invariant up...
Salvato in:
| Pubblicato in: | Cryptogr Commun |
|---|---|
| Autori principali: | , , , |
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
2019
|
| Soggetti: | |
| Accesso online: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7047778/ https://ncbi.nlm.nih.gov/pubmed/32117514 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/s12095-019-00377-3 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne! !
|