2000•Unpublished venueRequires access

The Polynomial‐Time Hierarchy and Polynomial Space

Ding‐Zhu Du, Ker‐I Ko

Abstract

This chapter contains sections titled: Nondeterministic Oracle Turing Machines Polynomial-Time Hierarchy Complete Problems in PH Alternating Turing Machines PSPACE-Complete Problems EXP-Complete Problems

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Time hierarchy theorem, PSPACE, Turing machine, Nondeterministic algorithm, NP, Polynomial hierarchy, Hierarchy, Oracle

Back to paper search Browse research topics Original source

The Polynomial‐Time Hierarchy and Polynomial Space — Research Paper | ScholarLens