The following pages link to (Q3941393):
Displaying 8 items.
- Polynomial time computations in models of ET (Q795035) (← links)
- On the scheme of induction for bounded arithmetic formulas (Q1104318) (← links)
- Rudimentary reductions revisited (Q1183444) (← links)
- The graph of multiplication is equivalent to counting (Q1190513) (← links)
- Bounded arithmetic, proof complexity and two papers of Parikh (Q1295443) (← links)
- Pell equations and exponentiation in fragments of arithmetic (Q1919524) (← links)
- Quadratic forms in models of \(I\Delta _{0}+\Omega _{1}\). I (Q2382276) (← links)
- The role of rudimentary relations in complexity theory (Q3347299) (← links)
