Let $\mathrm{SpaceTMSat} = \{\langle M, w, 1^n\rangle\mid\text {DTM $M$ accepts $w$ in space }n\}$.How do I prove that this language is PSPACE-complete?NP contains NP-complete problems and so does PSPACE. Am I supposed to prove it the same way as I would prove an NP-complete problem?
Proving that $\mathrm{SpaceTMSat}$ is PSPACE-complete
complexity theory