scientific article; zbMATH DE number 3566168

MaRDI QIDQ4138134zbMATH OpenFDO

Authors K. Mehlhorn

Publication date 1974

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Analysis of algorithms and problem complexity (68Q25)

Cited in

(5)

• Minimal pairs of polynomial degrees with subexponential complexity
• Characterizing polynomial time complexity of stream programs using interpretations
• Representations and evaluation strategies for feasibly approximable functions
• Theory of higher order interpretations and application to basic feasible functions
• Two algorithms in search of a type-system

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 Q4138134)