Name
Abstract | ||
|---|---|---|
We 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 define 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. |
Year | Venue | Keywords |
|---|---|---|
2007 | JOURNAL OF UNIVERSAL COMPUTER SCIENCE | static computation,C plus plus templates,polytime computable functions |
Field | DocType | Volume |
Primitive recursive function,Compile time,Computer science,Algorithm,Compiler,Theoretical computer science,Recursive functions,Time complexity,Computable function,Computation | Journal | 13 |
Issue | ISSN | Citations |
4 | 0948-695X | 0 |
PageRank | References | Authors |
0.34 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Emanuele Covino | 1 | 11 | 5.80 |
| Giovanni Pani | 2 | 8 | 5.71 |
| Daniele Scrimieri | 3 | 10 | 3.22 |