Category:Computational problems

C

• Computational problems in graph theory (3 C, 46 P)

D

• Distributed computing problems (2 C, 26 P)

N

• NL-complete problems (2 P)
• NP-complete problems (7 C, 132 P)
• NP-hard problems (1 C, 12 P)

P

• P-complete problems (3 P)
• Polynomial-time problems (12 P)
• PSPACE-complete problems (13 P)

S

• Satisfiability problems (2 C, 11 P)

• Computational problem

A

• AI-complete

C

• Computing the permanent
• Counting problem (complexity)

D

• Decision problem
• Dining philosophers problem
• Dutch national flag problem

F

• Function problem

J

• Josephus problem

L

• Linear search problem
• List of PPAD-complete problems

N

• N-body problem

O

• Optimization problem

P

• ♯P-completeness of 01-permanent
• Promise problem

S

• Search problem
• Sharp-SAT
• Sum of radicals

T

• Tutte polynomial

U

• Unknotting problem

W

• Word problem (mathematics)