scientific article; zbMATH DE number 2006627

MaRDI QIDQ4436023zbMATH OpenFDO

Authors Klaus Aehlig, Jan Johannsen, Helmut Schwichtenberg, Sebastiaan A. Terwijn

Publication date 23 November 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2183/21830001.htm

zbMATH Keywords

parallel computationimplicit computational complexitylinear logicrecursionlambda calculusNChigher types

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Combinatory logic and lambda calculus (03B40) Higher-type and set recursion theory (03D65)

Recommendations

• Higher type recursion, ramification and polynomial time
• On the expressivity of linear recursion schemes
• Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity
• Types for complexity of parallel computation in pi-calculus
• Recursion in Higher Types and Resource Bounded Turing Machines
• Linear types and non-size-increasing polynomial time computation.
• scientific article; zbMATH DE number 3954267
• Linear complexity parallel algorithms for linear systems of equations with recursive structure
• scientific article; zbMATH DE number 1555966
• Compilation and evaluation of linear mutual recursions

Cited in

(5)

• The geometry of linear higher-order recursion
• Higher type recursion, ramification and polynomial time
• Characterizing parallel time by type 2 recursions with polynomial output length
• Types for Proofs and Programs
• Implicit characterizations of FPTIME and NC revisited

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