cl-banner

Automated Implicit Computational Complexity Analysis (System Description)

Martin Avanzini, Georg Moser, and Andreas Schnabl

Proceedings of the 4th International Joint Conference on Automated Reasoning (IJCAR 2008), Lecture Notes in Artificial Intelligence 5195, pp. 132 – 139, 2008.

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.

 

  PDF |    doi:10.1007/978-3-540-71070-7_10  |  © Springer

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
}
Nach oben scrollen