Pages that link to "Item:Q1210295"

The following pages link to The computational efficacy of finite-field arithmetic (Q1210295):

Displaying 11 items.

• Complexity of computation in finite fields (Q378003) (← links)
• Efficient software-implementation of finite fields with applications to cryptography (Q850780) (← links)
• Efficient hardware implementation of finite fields with applications to cryptography (Q850794) (← links)
• The weak lambda calculus as a reasonable machine (Q930866) (← links)
• An arithmetic model of computation equivalent to threshold circuits (Q1186610) (← links)
• Binary representations of finite fields and their application to complexity theory (Q1383509) (← links)
• Polynomial expressions of \(p\)-ary auction functions (Q2003342) (← links)
• On proposition and comparison of trace computation methods in finite field \(GF(2^m)\) (Q2721581) (← links)
• Dense Arithmetic over Finite Fields with the CUMODP Library (Q2879202) (← links)
• Efficient Finite Fields in the Maxima Computer Algebra System (Q3519552) (← links)
• Some results on uniform arithmetic circuit complexity (Q4285623) (← links)