How can I prove that binary multiplication decision problem is solved in O(logn) space?

213 Views Asked by At

I can prove this if I use a NTM Turing Machine, but it is required to use a two-taped DTM, while taking into account only the space of the second "work tape"