Cobham's Result on Efficient Computations
You can try to look at the paper A new recursion-theoretic characterization of the polytime functions by Stephen Bellantoni and Stephen Cook, which has very nice discussion on Cobham's polynomial-time characterization in the introduction section. This paper also has pointers to other related works. You can easily find the paper somewhere on the web in case you are not subscribed to Springer.