  We show that multiplication can be done in polynomial time on a three counter
machine that receives its input as the contents of two counters. The technique
is generalized to functions of two variables computable by deterministic Turing
machines in linear space.
