Characterising Space Complexity Classes via Knuth-Bendix Orders - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Characterising Space Complexity Classes via Knuth-Bendix Orders

Résumé

In this paper we study three different space complexity classes: LINSPACE, PSPACE, and ESPACE, which are commonly believed to be distinct. We give complete characterisations of these classes exploiting rewrite systems, whose termination can be shown by Knuth-Bendix orders. To capture LINSPACE, we consider positively weighted systems. To capture PSPACE, we consider unary rewrite systems, where we allow for padding of the input. And to capture ESPACE, we make use of a variant of the Knuth-Bendix order, induced by quasi-precedences.
Fichier non déposé

Dates et versions

inria-00535541 , version 1 (11-11-2010)

Identifiants

  • HAL Id : inria-00535541 , version 1

Citer

Guillaume Bonfante, Georg Moser. Characterising Space Complexity Classes via Knuth-Bendix Orders. 17th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning - LPAR-17, Oct 2010, Yogyakarta, Indonesia. pp.142--156. ⟨inria-00535541⟩
97 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More