NPSPACE

• NSPACE( s(n) ) is the set of languages that can be decided by an NTM using no more than O( s(n) ) cells

• NPSPACE is the set of languages that can be decided in polyspace, by a NTM

  • doesn’t gain us much...

• THRM Savitch’s: NSPACE(f(n) ) ? SPACE(f2(n))

  • Proof by constructing a recursive algorithm
  • This implies that NPSPACE = PSPACE

Previous slide

Next slide

Back to first slide

View graphic version