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
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.3103/s0027132209040019 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2024684344 / rank | |||
Normal rank | |||
Latest revision as of 08:41, 30 July 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
