Compile-time Computation of Polytime Functions

dc.creatorCovino,Emanuele
dc.creatorPani,Giovanni
dc.creatorScrimieri,Daniele
dc.date2007
dc.date.accessioned2024-02-06T12:55:18Z
dc.date.available2024-02-06T12:55:18Z
dc.descriptionWe investigate the computational power of C++ compilers. In particular, it is known that any partial recursive function can be computed at compile time, using the template mechanism to de¯ne primitive recursion, composition, and minimalization. We show that polynomial time computable functions can be computed at compile-time using the same mechanism, together with template specialization.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-013-04-0468
dc.identifierhttps://lib.jucs.org/article/28768/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/9314
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 13(4): 468-478
dc.subjectstatic computation
dc.subjectC++ templates
dc.subjectpolytime computable functions
dc.titleCompile-time Computation of Polytime Functions
dc.typeResearch Article
Файлы