Pages that link to "Item:Q1186610"
From MaRDI portal
The following pages link to An arithmetic model of computation equivalent to threshold circuits (Q1186610):
Displaying 6 items.
- On read-once threshold formulae and their randomized decision tree complexity (Q1208407) (← links)
- The computational efficacy of finite-field arithmetic (Q1210295) (← links)
- Non-commutative arithmetic circuits: depth reduction and size lower bounds (Q1274913) (← links)
- On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits (Q1567407) (← links)
- Extensions of an idea of McNaughton (Q3489464) (← links)
- Some results on uniform arithmetic circuit complexity (Q4285623) (← links)
