Read on Wikipedia

Image: Siddharthist · CC BY-SA 4.0

PSPACE

PSPACE

Class of computational complexity.

Super rare
68 views/day0 owners

No account needed. By playing, you confirm you're 13 or older and agree to the Terms of use.

No owners yet

Super rareTop 12%

Category: Empty

0 owners
0 copies
0 pulls
Wishlisted
0
In 0 albums
On 0 showcases
Market listings
0
Wikipedia views per dayLast 30 days 2,158

Not sold on the market yet.

Readers' pathsAug 2026 – Oct 2026

Readers go next to

Share of the 2,343 clicks on its links

  1. Polynomial hierarchy

    Computer science concept.

    6.1%

  2. NP (complexity)

    Complexity class used to classify decision problems.

    5.5%

  3. Turing machine

    Computation model defining an abstract machine.

    4.4%

  4. Polynomial

    Type of mathematical expression.

    3.3%

  5. Complexity class

    Set of problems in computational complexity theory.

    1.7%

  6. Decision problem

    Yes/no problem in computer science.

    1.7%

Readers come from

Share of the 2,080 readers arriving from another article

  1. Complexity class

    Set of problems in computational complexity theory.

    11%

  2. Checkers

    Strategy board game.

    6.2%

  3. Go and mathematics

    Calculations of the game complexity of Go.

    6.1%

  4. BQP

    Computational complexity class of problems.

    5.4%

  5. Polynomial hierarchy

    Computer science concept.

    4.8%

  6. IP (complexity)

    Complexity class from interactive proofs.

    4%

  7. NP (complexity)

    Complexity class used to classify decision problems.

    2.9%

  8. Ray tracing (graphics)

    Rendering method.

    2.3%

  9. NP-hardness

    Complexity class.

    2.2%

  10. Ryan Williams (computer scientist)

    American computer scientist (born 1969).

    1.7%