Pages that link to "Item:Q1210295"

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

Displaying 3 items.

• The weak lambda calculus as a reasonable machine (Q930866) (← links)
• An arithmetic model of computation equivalent to threshold circuits (Q1186610) (← links)
• Polynomial expressions of \(p\)-ary auction functions (Q2003342) (← links)