The following pages link to Isabel Oitavem (Q276256):
Displaying 22 items.
- Two function algebras defining functions in \(\mathsf{NC}^k\) Boolean circuits (Q276257) (← links)
- (Q639667) (redirect page) (← links)
- A recursion-theoretic approach to NP (Q639668) (← links)
- A term rewriting characterization of the functions computable in polynomial space (Q1407521) (← links)
- Separating NC along the \(\delta\) axis (Q1827390) (← links)
- Applicative theories for the polynomial hierarchy of time and its levels (Q1946672) (← links)
- The polynomial hierarchy of functions and its levels (Q2062128) (← links)
- Implicit recursion-theoretic characterizations of counting classes (Q2085583) (← links)
- An interpretation of \(S_2^1\) in \(\Sigma_1^b\)-NIA (Q2642795) (← links)
- Monotonicity Constraints in Characterizations of PSPACE (Q2882555) (← links)
- From determinism, non-determinism and alternation to recursion schemes for P, NP and Pspace (Invited Talk) (Q2958508) (← links)
- (Q3081649) (← links)
- Characterizing PSPACE with pointers (Q3506329) (← links)
- Recursion Schemata for NC k (Q3540170) (← links)
- Towards an Implicit Characterization of NC k (Q3613339) (← links)
- (Q4339320) (← links)
- (Q4436033) (← links)
- Characterizing <i>NC</i> with tier 0 pointers (Q4458695) (← links)
- (Q4964698) (← links)
- Lorenzen Between Gentzen and Schütte (Q5024725) (← links)
- A recursion-theoretic characterisation of the positive polynomial-time functions (Q5079742) (← links)
- (Q6168449) (← links)
