Pages that link to "Item:Q2852140"

The following pages link to On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic 2 (Q2852140):

Displaying 11 items.

• Complexity of computation in finite fields (Q378003) (← links)
• On the size of depth-two threshold circuits for the inner product mod 2 function (Q782579) (← links)
• On the complexity of parallel algorithms for computing inverses in \(\text{GF}(2^m)\) with \(m\) prime (Q850789) (← links)
• Fast algorithm of square rooting in some finite fields of odd characteristic (Q1725540) (← links)
• On the number of multiplications needed to invert a monic power series over fields of characteristic two (Q2387412) (← links)
• The complexity and depth of Boolean circuits for multiplication and inversion in some fields \(\mathrm{GF}(2^{n})\) (Q2513076) (← links)
• Fast algorithms for solving equations of degree \(\le 4\) in some finite fields (Q2666933) (← links)
• Characterizing Negabent Boolean Functions over Finite Fields (Q2907279) (← links)
• (Q4276330) (← links)
• (Q5150372) (← links)
• Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two (Q5449840) (← links)