A characterization of Alternating log time by first order functional programs - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

A characterization of Alternating log time by first order functional programs

Résumé

We a give an intrinsic characterization of the class of functions which are computable in $\NCUN$ that is by a uniform, logarithmic depth and polynomial size family circuit. Recall that the class of functions in \Alogtime, that is in logarithmic time on an Alternating Turing Machine, is $\NCUN$. Our characterization is in terms of first order functional programming languages. We define measure-tools called Sup-interpretations, which allow to give space and time bounds and allow also to capture a lot of program schemas. This study is part of a research on static analysis in order to predict program resources. It is related to the notion of Quasi-interpretations and belongs to the implicit computational complexity line of research.
Fichier principal
Vignette du fichier
44.pdf (208.5 Ko) Télécharger le fichier
Loading...

Dates et versions

inria-00110014 , version 1 (26-10-2006)

Identifiants

  • HAL Id : inria-00110014 , version 1

Citer

Romain Péchoux, Jean-Yves Marion, Guillaume Bonfante. A characterization of Alternating log time by first order functional programs. 13th International Conference on Logic for Programming Artificial Intelligence and Reasoning - LPAR-13, Nov 2006, Phnom Penh/Cambodia. ⟨inria-00110014⟩
102 Consultations
197 Téléchargements

Partager

Gmail Facebook X LinkedIn More