Tailoring Recursion to Characterize Non-Deterministic Complexity Classes Over Arbitrary Structures - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2004

Tailoring Recursion to Characterize Non-Deterministic Complexity Classes Over Arbitrary Structures

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. The levels of the digital polynomial hierarchy correspond 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-00000520 , version 1 (26-10-2005)

Identifiants

  • HAL Id : inria-00000520 , version 1

Citer

Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion. Tailoring Recursion to Characterize Non-Deterministic Complexity Classes Over Arbitrary Structures. In 2nd APPSEM II Workshop - APPSEM'04, Apr 2004, Tallinn/Estonia. ⟨inria-00000520⟩
71 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More