scientific article; zbMATH DE number 7288619

MaRDI QIDQ5141617

Emmanuel Hainry, Romain Péchoux

Publication date: 18 December 2020

Full work available at URL: https://arxiv.org/abs/1801.08350

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

zbMATH Keywords

implicit computational complexitybasic feasible functionals

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Related Items (1)

Complete and tractable machine-independent characterizations of second-order polytime

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Higher-order interpretations and program complexity
• Quasi-interpretations. A way to control resources
• Characterizing polynomial time complexity of stream programs using interpretations
• A lattice-theoretical fixpoint theorem and its applications
• On characterizations of the basic feasible functionals, Part I
• Complexity theory for operators in analysis
• Higher order interpretation for higher order complexity
• Higher-Order Interpretations and Program Complexity

This page was built for publication: