article · CINECA IRIS Institutional Research Information System (University of Bari Aldo Moro) · 2008

Complexity certification of C++ template metaprogramming

PANI, Giovanni, COVINO, Emanuele

Cited by 0Abstract and details only

Abstract

Any partial recursive function can be computed at compile time, using\nC++ templates to define primitive recursion, composition, and minimalization.\nWe define a sub-language based on C++ templates, and we prove that it characterizes\nthe set of polynomial-time functions, that is the set of functions computable\nby a Turing machine with time bounded by a polynomial.

Cite this paper

APA 7

PANI, G., & COVINO, E. (2008). Complexity certification of C++ template metaprogramming. CINECA IRIS Institutional Research Information System (University of Bari Aldo Moro).

MLA 9

PANI, Giovanni, and Emanuele COVINO. “Complexity certification of C++ template metaprogramming.” CINECA IRIS Institutional Research Information System (University of Bari Aldo Moro), 2008.

Chicago

PANI, Giovanni, and Emanuele COVINO. 2008. “Complexity certification of C++ template metaprogramming.” CINECA IRIS Institutional Research Information System (University of Bari Aldo Moro).

Harvard

PANI, G. and COVINO, E. (2008) ‘Complexity certification of C++ template metaprogramming’, CINECA IRIS Institutional Research Information System (University of Bari Aldo Moro).

BibTeX

@article{pani2008complexity,
  title = {{Complexity certification of C++ template metaprogramming}},
  author = {PANI, Giovanni and COVINO, Emanuele},
  journal = {CINECA IRIS Institutional Research Information System (University of Bari Aldo Moro)},
  year = {2008}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.