Implicit Complexity Over an Arbitrary Structure: Sequential and Parallel Polynomial Time. - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Journal of Logic and Computation Année : 2005

Implicit Complexity Over an Arbitrary Structure: Sequential and Parallel Polynomial Time.

Felipe Cucker
  • Fonction : Auteur
Paulin Jacobé de Naurois
  • Fonction : Auteur
  • PersonId : 755751
  • IdRef : 086816845

Résumé

We provide several machine-independent characterizations of deterministic complexity classes in the model of computation proposed by L. Blum, M. Shub and S. Smale. We provide a characterization of partial recursive functions over any arbitrary structure. We show that polynomial time over an arbitrary structure can be characterized in terms of safe recursion. We show that polynomial parallel time over an arbitrary structure can be characterized in terms of safe recursion with substitutions.
Fichier non déposé

Dates et versions

inria-00102942 , version 1 (02-10-2006)

Identifiants

  • HAL Id : inria-00102942 , version 1

Citer

Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion. Implicit Complexity Over an Arbitrary Structure: Sequential and Parallel Polynomial Time.. Journal of Logic and Computation, 2005, 15 (1), pp.41--58. ⟨inria-00102942⟩
258 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More