The following pages link to Rudimentary reductions revisited (Q1183444):
Displayed 4 items.
- A constant-space sequential model of computation for first-order logic (Q1271562) (← links)
- Reductions in circuit complexity: An isomorphism theorem and a gap theorem (Q1276160) (← links)
- The complexity of computing maximal word functions (Q1321032) (← links)
- Uniform constant-depth threshold circuits for division and iterated multiplication. (Q1872733) (← links)