The complexity of optimization problems
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Termination proofs by multiset path orderings imply primitive recursive derivation lengths
Theoretical Computer Science - Selected papers of the Second International Conference on algebraic and logic programming, Nancy, France, October 1–3, 1990
A new recursion-theoretic characterization of the polytime functions
Computational Complexity
Handbook of Theoretical Computer Science
Handbook of Theoretical Computer Science
Termination of Rewrite Systems by Elementary Interpretations
Proceedings of the Third International Conference on Algebraic and Logic Programming
Polynomial Interpretations and the Complexity of Algorithms
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Generating Polynomial Orderings for Termination Proofs
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
Complexity Classes and Rewrite Systems with Polynomial Interpretation
Proceedings of the 12th International Workshop on Computer Science Logic
Simplification Orderings: History Of Results
Fundamenta Informaticae
Intensional Properties of Polygraphs
Electronic Notes in Theoretical Computer Science (ENTCS)
Characterizations of polynomial complexity classes with a better intensionality
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Proving Quadratic Derivational Complexities Using Context Dependent Interpretations
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Automated Implicit Computational Complexity Analysis (System Description)
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Automated Complexity Analysis Based on the Dependency Pair Method
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Complexity, Graphs, and the Dependency Pair Method
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Complexity analysis by rewriting
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Cdiprover3: a tool for proving derivational complexities of term rewriting systems
ESSLLI'08/09 Proceedings of the 2008 international conference on Interfaces: explorations in logic, language and computation
Characterising space complexity classes via Knuth-Bendix orders
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Quasi-interpretations a way to control resources
Theoretical Computer Science
A dependency pair framework for innermost complexity analysis of term rewrite systems
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Resource analysis by sup-interpretation
FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming
Complexity invariance of real interpretations
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Quasi-interpretations and small space bounds
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
A short introduction to implicit computational complexity
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
Synthesis of sup-interpretations: A survey
Theoretical Computer Science
| Hi-index | 0.00 |
We study the effect of polynomial interpretation termination proofs of deterministic (resp. non-deterministic) algorithms defined by con uent (resp. non-con uent) rewrite systems over data structures which include strings, lists and trees, and we classify them according to the interpretations of the constructors. This leads to the definition of six function classes which turn out to be exactly the deterministic (resp. non-deterministic) polynomial time, linear exponential time and linear doubly exponential time computable functions when the class is based on con uent (resp. non-con uent) rewrite systems. We also obtain a characterisation of the linear space computable functions. Finally, we demonstrate that functions with exponential interpretation termination proofs are super-elementary.