Analysing the implicit complexity of programs.
From MaRDI portal
Publication:1401939
DOI10.1016/S0890-5401(03)00011-7zbMath1054.68073MaRDI QIDQ1401939
Publication date: 19 August 2003
Published in: Information and Computation (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68N01: General topics in the theory of software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Orderings for term-rewriting systems
- Termination of rewriting
- The realm of primitive recursion
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths
- A new recursion-theoretic characterization of the polytime functions
- Results and trends in theoretical computer science, Colloquium in honor of Arto Salomaa, Graz, Austria, June 10-11, 1994. Proceedings
- Automated complexity analysis of Nuprl extracted programs
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- Characterizations of Pushdown Machines in Terms of Time-Bounded Computers