scientific article; zbMATH DE number 7438156

zbMath1476.68118arXiv1505.07163MaRDI QIDQ5013812

Naohi Eguchi

Publication date: 2 December 2021

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quasi-interpretations. A way to control resources
• A new recursion-theoretic characterization of the polytime functions
• Analysing the implicit complexity of programs.
• Algorithms with polynomial interpretation termination proof
• Transforming termination by self-labelling
• A Path Order for Rewrite Systems that Compute Exponential Time Functions
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

This page was built for publication: