A carregar...
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...
Na minha lista:
| Publicado no: | Cryptogr Commun |
|---|---|
| Main Authors: | , , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
2018
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7802510/ https://ncbi.nlm.nih.gov/pubmed/33442441 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/s12095-018-0297-2 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|