The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\) (Q2513076)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity and depth of Boolean circuits for multiplication and inversion in some fields GF(2ⁿ) |
scientific article; zbMATH DE number 6394008
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\) |
scientific article; zbMATH DE number 6394008 |
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
0.9663362
0 references
0.9351396
0 references
0.8887638
0 references
0.88417447
0 references
0.88331264
0 references
0.8824424
0 references
0.8817117
0 references
0.88035774
0 references
