The following pages link to (Q4062633):
Displaying 21 items.
- Corrigendum to: ``Uniform constant-depth threshold circuits for division and iterated multiplication'' (Q386053) (← links)
- Computation of recursive functionals using minimal initial segments (Q787965) (← links)
- On some natural complete operators (Q1064780) (← links)
- Some observations on the connection between counting and recursion (Q1098837) (← links)
- Polynomial and abstract subrecursive classes (Q1227276) (← links)
- Minimal pairs of polynomial degrees with subexponential complexity (Q1228203) (← links)
- A note on complexity measures for inductive classes in constructive type theory (Q1271558) (← links)
- A tight relationship between generic oracles and type-2 complexity theory (Q1369098) (← links)
- Domain-independent queries on databases with external functions (Q1389449) (← links)
- Uniform constant-depth threshold circuits for division and iterated multiplication. (Q1872733) (← links)
- Type-two polynomial-time and restricted lookahead (Q1989320) (← links)
- Algorithmically broad languages for polynomial time and space (Q2148807) (← links)
- Characterizing polynomial time complexity of stream programs using interpretations (Q2346991) (← links)
- Elementary analytic functions in \(\mathsf{VT}\mathsf{C}^0\) (Q2700809) (← links)
- (Q3923599) (← links)
- Continuous and monotone machines (Q5089226) (← links)
- (Q5094117) (← links)
- (Q5141617) (← links)
- A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY (Q5858921) (← links)
- A note on the relation between polynomial time functionals and Constable's class \(\mathcal K\) (Q6560166) (← links)
- On basic feasible functionals and the interpretation method (Q6629518) (← links)
