On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic 2 (Q2852140)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic 2
scientific article

    Statements

    On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic 2 (English)
    0 references
    0 references
    0 references
    0 references
    8 October 2013
    0 references
    0 references
    0 references