scientific article

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Items

Uniform constant-depth threshold circuits for division and iterated multiplication. ⋮ Some observations on the connection between counting and recursion ⋮ Algorithmically broad languages for polynomial time and space ⋮ A tight relationship between generic oracles and type-2 complexity theory ⋮ Corrigendum to: ``Uniform constant-depth threshold circuits for division and iterated multiplication ⋮ Domain-independent queries on databases with external functions ⋮ Computation models and function algebras ⋮ Expressing computational complexity in constructive type theory ⋮ Complete and tractable machine-independent characterizations of second-order polytime ⋮ Elementary analytic functions in \(\mathsf{VT}\mathsf{C}^0\) ⋮ Unnamed Item ⋮ Type-two polynomial-time and restricted lookahead ⋮ Polynomial and abstract subrecursive classes ⋮ Minimal pairs of polynomial degrees with subexponential complexity ⋮ Unnamed Item ⋮ A note on complexity measures for inductive classes in constructive type theory ⋮ Continuous and monotone machines ⋮ Unnamed Item ⋮ Computation of recursive functionals using minimal initial segments ⋮ A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY ⋮ Characterizing polynomial time complexity of stream programs using interpretations ⋮ On some natural complete operators