ロード中...
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...
保存先:
| 出版年: | Cryptogr Commun |
|---|---|
| 主要な著者: | , , |
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
2018
|
| 主題: | |
| オンライン･アクセス: | 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 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|