The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\) (Q2513076): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Sergey B. Gashkov / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Igor S. Sergeev / rank | |||
Normal rank | |||
Revision as of 09:09, 13 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\) |
scientific article |
Statements
The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\) (English)
0 references
2 February 2015
0 references
