Implicit Complexity over an Arbitrary Structure: Quantifier Alternations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2004

Implicit Complexity over an Arbitrary Structure: Quantifier Alternations

Abstract

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 principal
Vignette du fichier
A04-R-300.pdf (206.25 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00107811 , version 1 (19-10-2006)

Identifiers

  • HAL Id : inria-00107811 , version 1

Cite

Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion. Implicit Complexity over an Arbitrary Structure: Quantifier Alternations. [Intern report] A04-R-300 || bournez04e, 2004, 23 p. ⟨inria-00107811⟩
67 View
105 Download

Share

Gmail Facebook Twitter LinkedIn More