We propose to prove the theorem in the title. Let PLOSS be the class of sets recognizable on a deterministic Turing machine simultaneously in polynomial time and log squared space. Using the notation of Bruss and Meyer [1], PLOSS = υk TISP(nk,k log2n).
No takes yet. Share an insight, caveat, or question.
Stephen Cook (1979) studied this question.