The following pages link to (Q4850548):
Displayed 23 items.
- Regressive computations characterize logarithmic space (Q342702) (← links)
- Corrigendum to: ``Uniform constant-depth threshold circuits for division and iterated multiplication'' (Q386053) (← links)
- Conservative fragments of \({{S}^{1}_{2}}\) and \({{R}^{1}_{2}}\) (Q535152) (← links)
- The equivalence of theories that characterize ALogTime (Q834715) (← links)
- \(S_{k,\text{exp}}\) does not prove \(\text{NP} = \text{co-NP}\) uniformly (Q937909) (← links)
- The counting hierarchy in binary notation (Q1008842) (← links)
- Some results on cut-elimination, provable well-orderings, induction and reflection (Q1295413) (← links)
- A note on sharply bounded arithmetic (Q1325055) (← links)
- Separations of theories in weak bounded arithmetic (Q1344280) (← links)
- Nondeterministic stack register machines (Q1391527) (← links)
- A bounded arithmetic AID for Frege systems (Q1977488) (← links)
- Induction rules in bounded arithmetic (Q2309507) (← links)
- Bounded theories for polyspace computability (Q2450770) (← links)
- The weak pigeonhole principle for function classes inS12 (Q3418087) (← links)
- On a Theory for AC0 and the Strength of the Induction Scheme (Q4210843) (← links)
- Strengths and Weaknesses of LH Arithmetic (Q4531087) (← links)
- A theory for Log-Space and NLIN versus co-NLIN (Q4650271) (← links)
- On End‐Extensions of Models of ¬exp (Q4868237) (← links)
- On the finite axiomatizability of (Q5109206) (← links)
- New substitution bases for complexity classes (Q5112387) (← links)
- On the coincidence of complexity classes BPC and \(\text{TC}^0 \) (Q6043894) (← links)
- Computation models and function algebras (Q6064278) (← links)
- Frege proof system and TNC° (Q6064284) (← links)