Polynomial Hierarchy

The Polynomial Hierarchy is a hierarchy of complexity classes that extends the classes P, NP, and co-NP by iterative oracle access to decision problems, where each level consists of problems solvable in polynomial time with a logarithmic number of alternations between existential and universal quantifiers over polynomially bounded nondeterministic computations.

284

Publications

17.3K

Citations

381

Authors

229

Institutions

Publications per year

2017–2026

45

Authors

381

  1. LA
    Lane A. Hemaspaandra

    University of Rochester, United States

    11 publications · 469 citations

    11

    h-index

  2. EH
    Edith Hemaspaandra

    Rochester Institute of Technology, United States

    11 publications · 382 citations

    11

    h-index

  3. LF
    Lance Fortnow

    University of Chicago, United States

    7 publications · 1.3K citations

    7

    h-index

  4. AL
    Alan L. Selman

    University at Buffalo, State University of New York, United States

    7 publications · 306 citations

    7

    h-index

  5. JW
    Johannes Wallner

    TU Wien, Austria

    7 publications · 203 citations

    7

    h-index

1–5 of 381

Venues

  1. SIAM Journal on Computing

    23 publications · 1.8K citations

    18

    h-index

  2. Theoretical Computer Science

    13 publications · 1.1K citations

    13

    h-index

  3. arXiv (Cornell University)

    Repository · 14 publications · 528 citations

    11

    h-index

  4. Journal of the ACM

    JACM · 8 publications · 1.6K citations

    8

    h-index

  5. Journal of Computer and System Sciences

    6 publications · 445 citations

    6

    h-index

1–5