A combination framework for complexity
Authors:
- Martin AvanziniMAMartin Avanzini
- Georg MoserGMGeorg Moser
- 1 June 2016
- journal article
- Published by Elsevier in Information and Computation
- Vol. 248, 22-55
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- FWF (I-603-N18)
This publication has 13 references indexed in Scilit:
- A new order-theoretic characterisation of the polytime computable functionsTheoretical Computer Science, 2015
- Polynomial Path OrdersLogical Methods in Computer Science, 2013
- Analyzing Innermost Runtime Complexity of Term Rewriting by Dependency PairsJournal of Automated Reasoning, 2013
- On Constructor Rewrite Systems and the Lambda CalculusLogical Methods in Computer Science, 2012
- Monotonicity Constraints for Termination in the Integer DomainLogical Methods in Computer Science, 2011
- Termination and Cost Analysis with COSTA and its User InterfacesElectronic Notes in Theoretical Computer Science, 2009
- Modular Termination Proofs for Rewriting Using Dependency PairsJournal of Symbolic Computation, 2002
- Algorithms with polynomial interpretation termination proofJournal of Functional Programming, 2001
- A new recursion-theoretic characterization of the polytime functionscomputational complexity, 1992
- Complexity analysis of term-rewriting systemsTheoretical Computer Science, 1989