FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

DOI10.1007/11590156zbMath1172.68482OpenAlexW2484051058MaRDI QIDQ5897797

Toshiyasu Arai, Georg Moser

Publication date: 14 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11590156

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (6)

Unnamed Item ⋮ Complexity Analysis by Rewriting ⋮ A lexicographic path order with slow growing derivation bounds ⋮ Dependency Pairs and Polynomial Path Orders ⋮ Predicatively computable functions on sets ⋮ A new order-theoretic characterisation of the polytime computable functions

This page was built for publication: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science