Syntactic characterization in Lisp of the polynomial complexity classes and hierarchy
UNSPECIFIED (1997) Syntactic characterization in Lisp of the polynomial complexity classes and hierarchy. In: 3rd Italian Conference on Algorithms and Complexity (CIAC 97), UNIV ROME LA SAPIENZA, ROME, ITALY, MAR 12-14, 1997. Published in: ALGORITHMS AND COMPLEXITY, 1203 pp. 61-73.Full text not available from this repository.
The definition of a class C of functions is syntactic if membership to C can be decided from the construction of its elements. Syntactic characterizations of PTIMEF, of PSPACEF, of the polynomial hierarchy PH, and of its subclasses Delta(n)(p) are presented. They are obtained by progressive restrictions of recursion in Lisp, and may be regarded as predicative according to a foundational point raised by Leivant.
|Item Type:||Conference Item (UNSPECIFIED)|
|Subjects:||Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software|
|Series Name:||LECTURE NOTES IN COMPUTER SCIENCE|
|Journal or Publication Title:||ALGORITHMS AND COMPLEXITY|
|Editor:||Bongiovanni, G and Bovet, DP and diBattista, G|
|Number of Pages:||13|
|Page Range:||pp. 61-73|
|Title of Event:||3rd Italian Conference on Algorithms and Complexity (CIAC 97)|
|Location of Event:||UNIV ROME LA SAPIENZA, ROME, ITALY|
|Date(s) of Event:||MAR 12-14, 1997|
Actions (login required)
Downloads per month over past year