Read on Wikipedia

Image: RobinK · GFDL

Decision problem

Decision problem

Yes/no problem in computer science.

Super rare
61 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 1,848

Not sold on the market yet.

Readers' pathsAug 2026 – Oct 2026

Readers go next to

Share of the 1,224 clicks on its links

  1. Formal language

    Sequence of words formed by specific rules.

    3.9%

  2. Decision theory

    Branch of applied probability theory.

    2.6%

  3. NP (complexity)

    Complexity class used to classify decision problems.

    1.6%

  4. Travelling salesman problem

    NP-hard problem in combinatorial optimization.

    0.98%

Readers come from

Share of the 1,719 readers arriving from another article

  1. NP (complexity)

    Complexity class used to classify decision problems.

    13%

  2. NP-completeness

    Complexity class.

    10%

  3. Complexity class

    Set of problems in computational complexity theory.

    4.9%

  4. NP-hardness

    Complexity class.

    4.1%

  5. Formal language

    Sequence of words formed by specific rules.

    4%

  6. Newcomb's problem

    Thought experiment.

    2.9%

  7. Time complexity

    Estimate of time taken for running an algorithm.

    2.7%

  8. PSPACE

    Class of computational complexity.

    2.3%

  9. Knapsack problem

    Problem in combinatorial optimization.

    1.7%

  10. Alan Turing

    English computer scientist (1912–1954).

    1.5%