A Formalization of Polytime Functions

Details A Formalization of Polytime Functions A Formalization of Polytime Functions

2011-02-27

arxiv.org/abs/1102.5495v2

Computer Science

Computational Complexity

13 pages

Scientific paper

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 the original characterization by Cobham that required a bound to be proved manually. Compared to the paper proof by Bellantoni and Cook, we have been careful in making our proof fully contructive so that we obtain more precise bounding polynomials and more efficient translations between the two characterizations. Another difference is that we consider functions on bitstrings instead of functions on positive integers. This latter change is motivated by the application of our formalization in the context of formal security proofs in cryptography. Based on our core formalization, we have started developing a library of polytime functions that can be reused to build more complex ones.

Affiliated with

Also associated with

No associations

Rating

A Formalization of Polytime Functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Formalization of Polytime Functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Formalization of Polytime Functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-53983