Scholarlink

We now move on from the theory of \(\mathrm {NP}\) -completeness and will next study classes between \(\mathrm {NP}\) and \(\mathrm {PSPACE}\) that are defined using the oracle Turing machine model. We will also study complete problems for \(\mathrm {PSPACE}\) .

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Beyond NP-Completeness

  • 章节

  • 发表日期：

    2025年

查看全文
  • Mitsunori Ogihara

摘要

We now move on from the theory of \(\mathrm {NP}\) -completeness and will next study classes between \(\mathrm {NP}\) and \(\mathrm {PSPACE}\) that are defined using the oracle Turing machine model. We will also study complete problems for \(\mathrm {PSPACE}\) .