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
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Fast multiplication of polynomials over fields of characteristic 2 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Modern computer algebra / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast computation of continued fraction expansions. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Computational Complexity of Continued Fractions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finite field towers: Iterated presentation and complexity of arithmetic. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal tower fields / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3499664 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An application of the method of additive chains to inversion in finite fields / rank | |||
Normal rank | |||
Revision as of 14:44, 9 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
