Implicit Complexity over an Arbitrary Structure: Quantifier Alternations - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Information and Computation Année : 2006

Implicit Complexity over an Arbitrary Structure: Quantifier Alternations

Résumé

We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We show that the levels of the polynomial hierarchy correspond to safe recursion with predicative minimization and the levels of the digital polynomial hierarchy to safe recursion with digital predicative minimization. Also, we show that polynomial alternating time corresponds to safe recursion with predicative substitutions and that digital polynomial alternating time corresponds to safe recursion with digital predicative substitutions.
Fichier non déposé

Dates et versions

inria-00000516 , version 1 (26-10-2005)

Identifiants

  • HAL Id : inria-00000516 , version 1

Citer

Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion. Implicit Complexity over an Arbitrary Structure: Quantifier Alternations. Information and Computation, 2006, 204 (2), pp.210--230. ⟨inria-00000516⟩
123 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More