scientific article; zbMATH DE number 3480091

Cited in

(24)

On some natural complete operators
Some observations on the connection between counting and recursion
Polynomial and abstract subrecursive classes
Minimal pairs of polynomial degrees with subexponential complexity
A note on complexity measures for inductive classes in constructive type theory
A tight relationship between generic oracles and type-2 complexity theory
Domain-independent queries on databases with external functions
Uniform constant-depth threshold circuits for division and iterated multiplication.
Algorithmically broad languages for polynomial time and space
Characterizing polynomial time complexity of stream programs using interpretations
Elementary analytic functions in \(\mathsf{VT}\mathsf{C}^0\)
Corrigendum to: ``Uniform constant-depth threshold circuits for division and iterated multiplication
scientific article; zbMATH DE number 3737028 (Why is no real title available?)
Continuous and monotone machines
A tier-based typed programming language characterizing feasible functionals
Theory of higher order interpretations and application to basic feasible functions
A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY
Computation models and function algebras
Expressing computational complexity in constructive type theory
Complete and tractable machine-independent characterizations of second-order polytime
A note on the relation between polynomial time functionals and Constable's class \(\mathcal K\)
On basic feasible functionals and the interpretation method
Complete and tractable machine-independent characterizations of second-order polytime
Computation of recursive functionals using minimal initial segments

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4062633)