The following pages link to (Q3757904):
Displaying 8 items.
- The strong exponential hierarchy collapses (Q584250) (← links)
- Diophantine induction (Q584258) (← links)
- Functional interpretations of feasibly constructive arithmetic (Q685962) (← links)
- Bounded arithmetic for NC, ALogTIME, L and NL (Q1192345) (← links)
- A new recursion-theoretic characterization of the polytime functions (Q1207333) (← links)
- Tight bounds on expected time to add correctly and add mostly correctly (Q1318774) (← links)
- Computing in Finite Time (Q3408878) (← links)
- (Q4268461) (← links)