We investigate the relationship between template metaprogramming and computational complexity, showing how C++ templates characterize the class of polynomialtime computable function, by means of template recursion and specialization. Hence, standard C++ compilers can be used to certify polytime-bounded programs.
Template Metaprogramming, Partial Evaluation and Computational Complexity Classes
COVINO, Emanuele;PANI, Giovanni
2010
Abstract
We investigate the relationship between template metaprogramming and computational complexity, showing how C++ templates characterize the class of polynomialtime computable function, by means of template recursion and specialization. Hence, standard C++ compilers can be used to certify polytime-bounded programs.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.
