On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic 2 (Q2852140)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6213815
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic 2 |
scientific article; zbMATH DE number 6213815 |
Statements
On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic 2 (English)
0 references
8 October 2013
0 references
0.9534258842468262
0 references
0.863408625125885
0 references
0.8510578870773315
0 references
0.839784562587738
0 references
0.8387881517410278
0 references
