scientific article; zbMATH DE number 1342224
From MaRDI portal
Publication:4263809
zbMath0934.03052MaRDI QIDQ4263809
Jean-Yves Marion, Hélène Touzet, Guillaume Bonfante, Adam Cichon
Publication date: 22 September 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Grammars and rewriting systems (68Q42) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (5)
On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting ⋮ Applications and extensions of context-sensitive rewriting ⋮ Derivational complexity and context-sensitive Rewriting ⋮ Relative undecidability in term rewriting. I: The termination hierarchy ⋮ Relative undecidability in term rewriting. II: The confluence hierarchy
This page was built for publication:
