A characterization of alternating log time by first order functional programs (2006)
| Venue: | In LPAR 2006, volume 4246 of LNAI |
| Citations: | 5 - 3 self |
BibTeX
@INPROCEEDINGS{Bonfante06acharacterization,
author = {Guillaume Bonfante and Jean-yves Marion and Romain Péchoux},
title = {A characterization of alternating log time by first order functional programs},
booktitle = {In LPAR 2006, volume 4246 of LNAI},
year = {2006},
pages = {90--104},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. We a give an intrinsic characterization of the class of functions which are computable in NC 1 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 NC 1. Our characterization is in terms of first order functional programming languages. We define measure-tools called Supinterpretations, 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. 1
