Function classes closed with respect to substitution and concatenation recursion on notation are characterized as the substitution closure of finite function sets. Consequently, the sets of TC0, NC1 and L computable functions are characterized as the substitution closure of a finite function set.
CRN elimination and Substitution Bases for Complexity Classes
MAZZANTI, STEFANO
2012-01-01
Abstract
Function classes closed with respect to substitution and concatenation recursion on notation are characterized as the substitution closure of finite function sets. Consequently, the sets of TC0, NC1 and L computable functions are characterized as the substitution closure of a finite function set.
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.
