Polynomials over the reals are safe for program interpretations - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Polynomials over the reals are safe for program interpretations

Résumé

In the field of implicit computational complexity, we are con- sidering in this paper the fruitful branch of interpretation methods. Due to their good intensional properties, they have been widely developped. Among usual issues is the synthesis problem which has been solved by the use of Tarski's decision procedure, and consequently interpretations are usually chosen over the reals rather than over the integers. Doing so, one cannot use anymore the (good) properties of the natural (well-) ordering of N employed to bound the complexity of programs. We show that, actually, polynomials over the reals benefit from some properties that allows their safe use for complexity. We illustrate this by two char- acterizations, one of PTIME and one of PSPACE.
Fichier principal
Vignette du fichier
FOPARAB.pdf (269.66 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00594663 , version 1 (20-05-2011)

Identifiants

  • HAL Id : hal-00594663 , version 1

Citer

Guillaume Bonfante, Florian Deloup, Antoine Henrot. Polynomials over the reals are safe for program interpretations. FOPARA 2009, Nov 2009, Eindhoven, European Union. ⟨hal-00594663⟩
336 Consultations
57 Téléchargements

Partager

Gmail Facebook X LinkedIn More