Abstract

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 command-line based)
system that implements the majority of these techniques and present experimental findings to
simplify comparisons.

BibTeX

@inproceedings{MAGMAS-IJCAR08,
  author      = "Martin Avanzini and Georg Moser and Andreas Schnabl",
  title       = "Automated Implicit Computational Complexity Analysis
                 (System Description)",
  booktitle   = "Proceedings of the 4th International Joint Conference on
                 Automated Reasoning",
  series      = "Lecture Notes in Artificial Intelligence",
  volume      = 5195,
  pages       = "132--139",
  publisher   = "Springer-Verlag",
  year        = 2008
}