1763 search results - page 1 / 353 » A Formalization of Polytime Functions |
CORR
2011
Springer
12 years 10 months ago
2011
Springer
Abstract. We present a deep embedding of Bellantoni and Cook’s syntactic characterization of polytime functions. We prove formally that it is correct and complete with respect to...
JC
2006
13 years 4 months ago
2006
We give a correspondence between two notions of complexity for real numbers and functions: poly-time computability according to Ko and a notion that arises naturally when one cons...
JUCS
2007
13 years 4 months ago
2007
: 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 mechan...
ESOP
2010
Springer
14 years 1 months ago
2010
Springer
AAAI
2008
13 years 6 months ago
2008
We introduce in this paper two new, complete propositional languages and study their properties in terms of (1) their support for polytime operations and (2) their ability to repr...