Sciweavers

Share
CADE
2008
Springer

Automated Implicit Computational Complexity Analysis (System Description)

8 years 5 months ago
Automated Implicit Computational Complexity Analysis (System Description)
Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully automatic and commandline based) system that implements the majority of these techniques and present experimental ndings to simplify comparisons.
Martin Avanzini, Georg Moser, Andreas Schnabl
Added 12 Oct 2010
Updated 12 Oct 2010
Type Conference
Year 2008
Where CADE
Authors Martin Avanzini, Georg Moser, Andreas Schnabl
Comments (0)
books