Strassen’s factoring algorithm shows that $ \text{FACTORING} \in \text{DTIME}(N^{\frac{1}{4}+o(1)})$ , but if I’m not mistaken in my analysis it also uses a similar amount of space. By making a trade-off I think it is possible to show $ \text{FACTORING} \in \text{DTISP}(N^{k+o(1)}, N^{\frac{1}{2}-k+o(1)})$ for $ \frac{1}{4} \leq k \leq \frac{1}{2}$ . On the other hand, trialRead more