Implicit Complexity Over an Arbitrary Structure: Sequential and Parallel Polynomial Time. - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Logic and Computation Year : 2005

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

Felipe Cucker
  • Function : Author
Paulin Jacobé de Naurois
  • Function : Author
  • PersonId : 755751
  • IdRef : 086816845

Abstract

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.
Not file

Dates and versions

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

Identifiers

  • HAL Id : inria-00102942 , version 1

Cite

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⟩
257 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More