Modular Complexity Analysis for Term Rewriting
From MaRDI portal
Publication:5408194
DOI10.2168/LMCS-10(1:19)2014zbMath1326.68172arXiv1402.0746MaRDI QIDQ5408194
Publication date: 9 April 2014
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.0746
Related Items
Constant runtime complexity of term rewriting is semi-decidable, A Perron-Frobenius theorem for deciding matrix growth, Lower bounds for runtime complexity of term rewriting, Unnamed Item
Uses Software