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^p_n 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.

Syntactic characterization in Lisp of the polynomial complexity classes and hierarchy

COVINO, Emanuele;
1997-01-01

Abstract

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^p_n 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.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11586/72718
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 3
  • ???jsp.display-item.citation.isi??? 3
social impact