A characterization of polynomial complexity classes using dependency pairs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2007

A characterization of polynomial complexity classes using dependency pairs

Abstract

The dependency pair method has already shown its power in proving termination of term rewriting systems. We adapt this framework using polynomial assignments in order to characterize with two distinct criteria the set of the functions computable in polynomial time and the set of the functions computable in polynomial space. To our knowledge, this is a first attempt to capture complexity classes using of the dependency pair method. The characterizations presented are inspired by previous works on implicit computational complexity, and, particularly, by the notions of quasi-interpretation and sup-interpretation. Both criteria are decidable so that we can synthesize resource upper-bounds.
Fichier principal
Vignette du fichier
dependency.pdf (205.82 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00155287 , version 1 (17-06-2007)

Identifiers

  • HAL Id : inria-00155287 , version 1

Cite

Jean-Yves Marion, Romain Péchoux. A characterization of polynomial complexity classes using dependency pairs. [Research Report] 2007, pp.12. ⟨inria-00155287⟩
77 View
60 Download

Share

Gmail Facebook Twitter LinkedIn More