The following pages link to Carl Sturtivant (Q1186609):
Displayed 5 items.
- An arithmetic model of computation equivalent to threshold circuits (Q1186610) (← links)
- The computational efficacy of finite-field arithmetic (Q1210295) (← links)
- Are there elimination algorithms for the permanent? (Q4033465) (← links)
- APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS (Q5687654) (← links)
- A circuit complexity formulation of algorithmic information theory (Q6090675) (← links)